./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:11:16,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:11:16,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:11:16,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:11:16,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:11:16,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:11:17,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:11:17,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:11:17,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:11:17,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:11:17,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:11:17,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:11:17,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:11:17,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:11:17,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:11:17,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:11:17,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:11:17,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:11:17,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:11:17,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:11:17,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:11:17,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:11:17,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:11:17,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:11:17,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:11:17,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:11:17,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:11:17,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:11:17,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:11:17,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:11:17,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:11:17,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:11:17,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:11:17,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:11:17,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:11:17,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:11:17,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:11:17,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:11:17,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:11:17,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:11:17,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:11:17,055 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 21:11:17,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:11:17,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:11:17,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:11:17,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:11:17,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:11:17,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:11:17,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:11:17,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:11:17,082 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:11:17,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:11:17,083 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:11:17,083 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:11:17,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:11:17,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:11:17,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:11:17,084 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 21:11:17,084 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 21:11:17,085 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 21:11:17,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:11:17,085 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:11:17,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:11:17,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:11:17,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:11:17,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:11:17,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:11:17,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:17,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:11:17,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:11:17,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:11:17,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:11:17,089 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc 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-11-02 21:11:17,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:11:17,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:11:17,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:11:17,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:11:17,403 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:11:17,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-11-02 21:11:17,480 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/data/8796ebad5/b4993895dc2c4e719e0989df2c01889a/FLAG5dae60bfe [2022-11-02 21:11:17,965 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:11:17,970 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-11-02 21:11:17,990 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/data/8796ebad5/b4993895dc2c4e719e0989df2c01889a/FLAG5dae60bfe [2022-11-02 21:11:18,320 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/data/8796ebad5/b4993895dc2c4e719e0989df2c01889a [2022-11-02 21:11:18,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:11:18,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:11:18,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:18,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:11:18,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:11:18,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fac4155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18, skipping insertion in model container [2022-11-02 21:11:18,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:11:18,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:11:18,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-11-02 21:11:18,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:18,744 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:11:18,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-11-02 21:11:18,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:18,861 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:11:18,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18 WrapperNode [2022-11-02 21:11:18,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:18,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:18,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:11:18,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:11:18,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,949 INFO L138 Inliner]: procedures = 29, calls = 43, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 662 [2022-11-02 21:11:18,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:18,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:11:18,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:11:18,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:11:18,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,986 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:18,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:11:18,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:11:18,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:11:18,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:11:18,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (1/1) ... [2022-11-02 21:11:19,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:19,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:19,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:19,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:11:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:11:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-11-02 21:11:19,084 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-11-02 21:11:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-02 21:11:19,084 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-02 21:11:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-11-02 21:11:19,084 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-11-02 21:11:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-02 21:11:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-02 21:11:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 21:11:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 21:11:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:11:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 21:11:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 21:11:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:11:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:11:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-11-02 21:11:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-11-02 21:11:19,213 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:11:19,216 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:11:19,357 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:11:19,363 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:11:19,367 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:11:19,374 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:11:19,377 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:11:19,907 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !false; [2022-11-02 21:11:19,908 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume false; [2022-11-02 21:11:19,908 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume !false; [2022-11-02 21:11:19,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume false; [2022-11-02 21:11:19,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume false; [2022-11-02 21:11:19,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !false; [2022-11-02 21:11:19,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-11-02 21:11:19,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-11-02 21:11:19,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !false; [2022-11-02 21:11:19,910 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume false; [2022-11-02 21:11:19,940 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:11:19,981 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-11-02 21:11:19,981 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-11-02 21:11:19,989 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:11:19,999 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:11:20,002 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:11:20,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:20 BoogieIcfgContainer [2022-11-02 21:11:20,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:11:20,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:11:20,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:11:20,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:11:20,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:11:18" (1/3) ... [2022-11-02 21:11:20,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785b3434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:20, skipping insertion in model container [2022-11-02 21:11:20,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:18" (2/3) ... [2022-11-02 21:11:20,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785b3434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:20, skipping insertion in model container [2022-11-02 21:11:20,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:20" (3/3) ... [2022-11-02 21:11:20,016 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-11-02 21:11:20,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:11:20,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 21:11:20,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:11:20,095 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fef82e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:11:20,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 21:11:20,101 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-11-02 21:11:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 21:11:20,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:20,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:20,109 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:20,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash -15799124, now seen corresponding path program 1 times [2022-11-02 21:11:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:20,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242718059] [2022-11-02 21:11:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:20,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:20,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:20,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242718059] [2022-11-02 21:11:20,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242718059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:20,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:20,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090046784] [2022-11-02 21:11:20,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:20,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:20,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:20,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:20,464 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-11-02 21:11:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:20,580 INFO L93 Difference]: Finished difference Result 211 states and 314 transitions. [2022-11-02 21:11:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:20,583 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-11-02 21:11:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:20,606 INFO L225 Difference]: With dead ends: 211 [2022-11-02 21:11:20,606 INFO L226 Difference]: Without dead ends: 207 [2022-11-02 21:11:20,608 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-11-02 21:11:20,612 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:20,613 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.1s Time] [2022-11-02 21:11:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-02 21:11:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2022-11-02 21:11:20,681 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-11-02 21:11:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 309 transitions. [2022-11-02 21:11:20,691 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 309 transitions. Word has length 8 [2022-11-02 21:11:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:20,693 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 309 transitions. [2022-11-02 21:11:20,694 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-11-02 21:11:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 309 transitions. [2022-11-02 21:11:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:11:20,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:20,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:20,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:11:20,697 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:20,698 INFO L85 PathProgramCache]: Analyzing trace with hash -191249987, now seen corresponding path program 1 times [2022-11-02 21:11:20,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:20,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138243852] [2022-11-02 21:11:20,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:20,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:20,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138243852] [2022-11-02 21:11:20,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138243852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:20,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:20,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:11:20,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689316086] [2022-11-02 21:11:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:20,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:20,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:20,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:20,777 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-11-02 21:11:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:20,819 INFO L93 Difference]: Finished difference Result 204 states and 308 transitions. [2022-11-02 21:11:20,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:20,820 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-11-02 21:11:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:20,821 INFO L225 Difference]: With dead ends: 204 [2022-11-02 21:11:20,821 INFO L226 Difference]: Without dead ends: 198 [2022-11-02 21:11:20,822 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-11-02 21:11:20,823 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-11-02 21:11:20,824 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-11-02 21:11:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-02 21:11:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-02 21:11:20,832 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-11-02 21:11:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2022-11-02 21:11:20,834 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 15 [2022-11-02 21:11:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:20,834 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2022-11-02 21:11:20,834 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-11-02 21:11:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2022-11-02 21:11:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 21:11:20,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:20,836 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-11-02 21:11:20,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:11:20,836 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:20,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash 705160586, now seen corresponding path program 1 times [2022-11-02 21:11:20,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:20,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859308602] [2022-11-02 21:11:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:21,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859308602] [2022-11-02 21:11:21,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859308602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:21,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:21,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:21,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856405951] [2022-11-02 21:11:21,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:21,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:21,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:21,020 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-11-02 21:11:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:21,192 INFO L93 Difference]: Finished difference Result 263 states and 373 transitions. [2022-11-02 21:11:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:21,192 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-11-02 21:11:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:21,194 INFO L225 Difference]: With dead ends: 263 [2022-11-02 21:11:21,194 INFO L226 Difference]: Without dead ends: 262 [2022-11-02 21:11:21,195 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-11-02 21:11:21,196 INFO L413 NwaCegarLoop]: 320 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, 426 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-11-02 21:11:21,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 426 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:11:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-02 21:11:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 249. [2022-11-02 21:11:21,210 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-11-02 21:11:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 357 transitions. [2022-11-02 21:11:21,212 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 357 transitions. Word has length 19 [2022-11-02 21:11:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:21,213 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 357 transitions. [2022-11-02 21:11:21,213 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-11-02 21:11:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 357 transitions. [2022-11-02 21:11:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:11:21,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:21,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:21,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:11:21,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2016043499, now seen corresponding path program 1 times [2022-11-02 21:11:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:21,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541184304] [2022-11-02 21:11:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:21,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:21,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541184304] [2022-11-02 21:11:21,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541184304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:21,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:21,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103952808] [2022-11-02 21:11:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:21,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:21,261 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-11-02 21:11:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:21,280 INFO L93 Difference]: Finished difference Result 306 states and 428 transitions. [2022-11-02 21:11:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:21,281 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-11-02 21:11:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:21,301 INFO L225 Difference]: With dead ends: 306 [2022-11-02 21:11:21,302 INFO L226 Difference]: Without dead ends: 306 [2022-11-02 21:11:21,302 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-11-02 21:11:21,303 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-11-02 21:11:21,304 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-11-02 21:11:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-02 21:11:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 287. [2022-11-02 21:11:21,316 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-11-02 21:11:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 406 transitions. [2022-11-02 21:11:21,318 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 406 transitions. Word has length 18 [2022-11-02 21:11:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:21,319 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 406 transitions. [2022-11-02 21:11:21,319 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-11-02 21:11:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 406 transitions. [2022-11-02 21:11:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 21:11:21,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:21,321 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-11-02 21:11:21,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:11:21,321 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1374657914, now seen corresponding path program 1 times [2022-11-02 21:11:21,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:21,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071864196] [2022-11-02 21:11:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:21,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:21,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071864196] [2022-11-02 21:11:21,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071864196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:21,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:21,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:11:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369437787] [2022-11-02 21:11:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:21,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:11:21,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:21,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:11:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:11:21,393 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-11-02 21:11:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:21,474 INFO L93 Difference]: Finished difference Result 286 states and 403 transitions. [2022-11-02 21:11:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:11:21,475 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-11-02 21:11:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:21,476 INFO L225 Difference]: With dead ends: 286 [2022-11-02 21:11:21,477 INFO L226 Difference]: Without dead ends: 286 [2022-11-02 21:11:21,477 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-11-02 21:11:21,478 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 25 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:21,478 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.1s Time] [2022-11-02 21:11:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-02 21:11:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-11-02 21:11:21,487 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-11-02 21:11:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 403 transitions. [2022-11-02 21:11:21,489 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 403 transitions. Word has length 29 [2022-11-02 21:11:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:21,489 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 403 transitions. [2022-11-02 21:11:21,490 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-11-02 21:11:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 403 transitions. [2022-11-02 21:11:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 21:11:21,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:21,505 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-11-02 21:11:21,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:11:21,506 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash -889185583, now seen corresponding path program 1 times [2022-11-02 21:11:21,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:21,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698108373] [2022-11-02 21:11:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:21,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:21,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:21,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698108373] [2022-11-02 21:11:21,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698108373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:21,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:21,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:21,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705395535] [2022-11-02 21:11:21,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:21,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:21,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:21,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:21,734 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-11-02 21:11:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:21,989 INFO L93 Difference]: Finished difference Result 303 states and 422 transitions. [2022-11-02 21:11:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:11:21,990 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-11-02 21:11:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:21,992 INFO L225 Difference]: With dead ends: 303 [2022-11-02 21:11:21,992 INFO L226 Difference]: Without dead ends: 303 [2022-11-02 21:11:21,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:21,995 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 331 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:22,001 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.2s Time] [2022-11-02 21:11:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-02 21:11:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2022-11-02 21:11:22,019 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-11-02 21:11:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 415 transitions. [2022-11-02 21:11:22,032 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 415 transitions. Word has length 33 [2022-11-02 21:11:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:22,033 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 415 transitions. [2022-11-02 21:11:22,033 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-11-02 21:11:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 415 transitions. [2022-11-02 21:11:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 21:11:22,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:22,035 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-11-02 21:11:22,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:11:22,035 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2121154083, now seen corresponding path program 1 times [2022-11-02 21:11:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:22,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994833627] [2022-11-02 21:11:22,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:22,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:22,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:22,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994833627] [2022-11-02 21:11:22,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994833627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:22,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:22,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:22,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667921109] [2022-11-02 21:11:22,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:22,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:22,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:22,187 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-11-02 21:11:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:22,467 INFO L93 Difference]: Finished difference Result 303 states and 421 transitions. [2022-11-02 21:11:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:11:22,468 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-11-02 21:11:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:22,470 INFO L225 Difference]: With dead ends: 303 [2022-11-02 21:11:22,470 INFO L226 Difference]: Without dead ends: 303 [2022-11-02 21:11:22,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:22,472 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 316 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:22,472 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.2s Time] [2022-11-02 21:11:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-02 21:11:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2022-11-02 21:11:22,482 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-11-02 21:11:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2022-11-02 21:11:22,484 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 34 [2022-11-02 21:11:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:22,484 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2022-11-02 21:11:22,485 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-11-02 21:11:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2022-11-02 21:11:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 21:11:22,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:22,487 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-11-02 21:11:22,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:11:22,487 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1780979361, now seen corresponding path program 1 times [2022-11-02 21:11:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:22,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233253316] [2022-11-02 21:11:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:22,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:22,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233253316] [2022-11-02 21:11:22,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233253316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:22,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:22,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:22,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408546559] [2022-11-02 21:11:22,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:22,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:11:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:22,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:22,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:22,553 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-11-02 21:11:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:22,760 INFO L93 Difference]: Finished difference Result 278 states and 380 transitions. [2022-11-02 21:11:22,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:22,760 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-11-02 21:11:22,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:22,763 INFO L225 Difference]: With dead ends: 278 [2022-11-02 21:11:22,763 INFO L226 Difference]: Without dead ends: 278 [2022-11-02 21:11:22,764 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-11-02 21:11:22,767 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:22,769 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.2s Time] [2022-11-02 21:11:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-02 21:11:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 264. [2022-11-02 21:11:22,786 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-11-02 21:11:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 365 transitions. [2022-11-02 21:11:22,789 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 365 transitions. Word has length 34 [2022-11-02 21:11:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:22,789 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 365 transitions. [2022-11-02 21:11:22,791 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-11-02 21:11:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 365 transitions. [2022-11-02 21:11:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 21:11:22,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:22,795 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-11-02 21:11:22,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:11:22,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:22,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2069817079, now seen corresponding path program 1 times [2022-11-02 21:11:22,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:22,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538002230] [2022-11-02 21:11:22,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:22,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:22,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:22,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538002230] [2022-11-02 21:11:22,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538002230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:22,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:22,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:11:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060994256] [2022-11-02 21:11:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:22,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:11:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:11:22,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:11:22,905 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-11-02 21:11:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:23,030 INFO L93 Difference]: Finished difference Result 282 states and 384 transitions. [2022-11-02 21:11:23,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:11:23,031 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-11-02 21:11:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:23,033 INFO L225 Difference]: With dead ends: 282 [2022-11-02 21:11:23,033 INFO L226 Difference]: Without dead ends: 282 [2022-11-02 21:11:23,033 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-11-02 21:11:23,036 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 289 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-02 21:11:23,037 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-11-02 21:11:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-02 21:11:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 264. [2022-11-02 21:11:23,049 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-11-02 21:11:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 363 transitions. [2022-11-02 21:11:23,051 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 363 transitions. Word has length 34 [2022-11-02 21:11:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:23,051 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 363 transitions. [2022-11-02 21:11:23,052 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-11-02 21:11:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 363 transitions. [2022-11-02 21:11:23,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 21:11:23,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:23,057 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-11-02 21:11:23,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:11:23,057 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:23,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:23,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1120484039, now seen corresponding path program 1 times [2022-11-02 21:11:23,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:23,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118949763] [2022-11-02 21:11:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:23,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:23,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:23,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118949763] [2022-11-02 21:11:23,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118949763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:23,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:23,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:11:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290699780] [2022-11-02 21:11:23,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:23,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:11:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:11:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:11:23,125 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-11-02 21:11:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:23,212 INFO L93 Difference]: Finished difference Result 258 states and 352 transitions. [2022-11-02 21:11:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:11:23,213 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-11-02 21:11:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:23,215 INFO L225 Difference]: With dead ends: 258 [2022-11-02 21:11:23,215 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 21:11:23,216 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-11-02 21:11:23,217 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 285 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:23,218 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.1s Time] [2022-11-02 21:11:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 21:11:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-02 21:11:23,220 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-11-02 21:11:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-11-02 21:11:23,222 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 35 [2022-11-02 21:11:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:23,223 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-11-02 21:11:23,225 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-11-02 21:11:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-11-02 21:11:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:11:23,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:23,226 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-11-02 21:11:23,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:11:23,227 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1877593248, now seen corresponding path program 1 times [2022-11-02 21:11:23,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:23,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366583299] [2022-11-02 21:11:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:11:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 21:11:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:23,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366583299] [2022-11-02 21:11:23,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366583299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:23,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:23,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874074906] [2022-11-02 21:11:23,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:23,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:11:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:23,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:23,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:23,308 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-11-02 21:11:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:23,371 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-11-02 21:11:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:23,372 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-11-02 21:11:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:23,373 INFO L225 Difference]: With dead ends: 80 [2022-11-02 21:11:23,373 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 21:11:23,374 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-11-02 21:11:23,375 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-11-02 21:11:23,375 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-11-02 21:11:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 21:11:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-02 21:11:23,377 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-11-02 21:11:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2022-11-02 21:11:23,378 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 39 [2022-11-02 21:11:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:23,378 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2022-11-02 21:11:23,378 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-11-02 21:11:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-11-02 21:11:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 21:11:23,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:23,379 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-11-02 21:11:23,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:11:23,379 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1958713032, now seen corresponding path program 1 times [2022-11-02 21:11:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:23,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175901713] [2022-11-02 21:11:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:23,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175901713] [2022-11-02 21:11:23,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175901713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:23,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:23,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285029427] [2022-11-02 21:11:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:23,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:11:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:23,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:11:23,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:11:23,541 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-11-02 21:11:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:23,633 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-11-02 21:11:23,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:11:23,634 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-11-02 21:11:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:23,635 INFO L225 Difference]: With dead ends: 98 [2022-11-02 21:11:23,635 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 21:11:23,635 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-11-02 21:11:23,636 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 22 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:23,636 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.1s Time] [2022-11-02 21:11:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 21:11:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2022-11-02 21:11:23,638 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-11-02 21:11:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-11-02 21:11:23,639 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 41 [2022-11-02 21:11:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:23,639 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-11-02 21:11:23,640 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-11-02 21:11:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-11-02 21:11:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 21:11:23,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:23,640 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-11-02 21:11:23,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:11:23,641 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:23,641 INFO L85 PathProgramCache]: Analyzing trace with hash -306878835, now seen corresponding path program 1 times [2022-11-02 21:11:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:23,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872314301] [2022-11-02 21:11:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:23,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872314301] [2022-11-02 21:11:23,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872314301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:23,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:23,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682719011] [2022-11-02 21:11:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:23,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:11:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:23,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:11:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:11:23,767 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-11-02 21:11:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:23,873 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-11-02 21:11:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:11:23,874 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-11-02 21:11:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:23,875 INFO L225 Difference]: With dead ends: 89 [2022-11-02 21:11:23,875 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 21:11:23,875 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-11-02 21:11:23,876 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:23,876 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.1s Time] [2022-11-02 21:11:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 21:11:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-11-02 21:11:23,878 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-11-02 21:11:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2022-11-02 21:11:23,879 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 43 [2022-11-02 21:11:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:23,879 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2022-11-02 21:11:23,879 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-11-02 21:11:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-11-02 21:11:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 21:11:23,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:23,880 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-11-02 21:11:23,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:11:23,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:23,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1924386198, now seen corresponding path program 1 times [2022-11-02 21:11:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:23,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589295112] [2022-11-02 21:11:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:23,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:23,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:23,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589295112] [2022-11-02 21:11:23,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589295112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:23,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:23,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:23,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341049761] [2022-11-02 21:11:23,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:23,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:11:23,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:23,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:23,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:23,938 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-11-02 21:11:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:23,999 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2022-11-02 21:11:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:24,000 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-11-02 21:11:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:24,001 INFO L225 Difference]: With dead ends: 99 [2022-11-02 21:11:24,001 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 21:11:24,001 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-11-02 21:11:24,002 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-11-02 21:11:24,002 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-11-02 21:11:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 21:11:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-11-02 21:11:24,004 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-11-02 21:11:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-11-02 21:11:24,005 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 42 [2022-11-02 21:11:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:24,005 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-11-02 21:11:24,006 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-11-02 21:11:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-11-02 21:11:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 21:11:24,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:24,006 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-11-02 21:11:24,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:11:24,007 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:24,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1375541140, now seen corresponding path program 1 times [2022-11-02 21:11:24,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:24,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460352719] [2022-11-02 21:11:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,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-11-02 21:11:24,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:24,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460352719] [2022-11-02 21:11:24,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460352719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:24,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:24,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891273568] [2022-11-02 21:11:24,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:24,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:11:24,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:24,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:24,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:24,073 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-11-02 21:11:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:24,149 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2022-11-02 21:11:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:11:24,150 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-11-02 21:11:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:24,151 INFO L225 Difference]: With dead ends: 167 [2022-11-02 21:11:24,151 INFO L226 Difference]: Without dead ends: 167 [2022-11-02 21:11:24,152 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-11-02 21:11:24,155 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:24,155 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.1s Time] [2022-11-02 21:11:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-02 21:11:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-11-02 21:11:24,161 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-11-02 21:11:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2022-11-02 21:11:24,162 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 44 [2022-11-02 21:11:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:24,162 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2022-11-02 21:11:24,163 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-11-02 21:11:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2022-11-02 21:11:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 21:11:24,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:24,164 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-11-02 21:11:24,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:11:24,164 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:24,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1144418794, now seen corresponding path program 1 times [2022-11-02 21:11:24,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:24,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610246757] [2022-11-02 21:11:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:24,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:24,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:24,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610246757] [2022-11-02 21:11:24,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610246757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:24,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:24,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:11:24,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221466834] [2022-11-02 21:11:24,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:24,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:11:24,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:24,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:11:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:11:24,332 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-11-02 21:11:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:24,394 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2022-11-02 21:11:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:11:24,394 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-11-02 21:11:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:24,395 INFO L225 Difference]: With dead ends: 145 [2022-11-02 21:11:24,396 INFO L226 Difference]: Without dead ends: 145 [2022-11-02 21:11:24,396 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-11-02 21:11:24,396 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:24,397 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.1s Time] [2022-11-02 21:11:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-02 21:11:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-02 21:11:24,400 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-11-02 21:11:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2022-11-02 21:11:24,401 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 44 [2022-11-02 21:11:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:24,401 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2022-11-02 21:11:24,401 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-11-02 21:11:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2022-11-02 21:11:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 21:11:24,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:24,402 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-11-02 21:11:24,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:11:24,403 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1135569949, now seen corresponding path program 1 times [2022-11-02 21:11:24,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:24,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334142881] [2022-11-02 21:11:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:24,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:24,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334142881] [2022-11-02 21:11:24,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334142881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:24,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:24,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:11:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097558080] [2022-11-02 21:11:24,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:24,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:24,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:24,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:24,548 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-11-02 21:11:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:24,699 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-11-02 21:11:24,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:11:24,700 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-11-02 21:11:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:24,701 INFO L225 Difference]: With dead ends: 133 [2022-11-02 21:11:24,701 INFO L226 Difference]: Without dead ends: 129 [2022-11-02 21:11:24,701 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-11-02 21:11:24,702 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-02 21:11:24,702 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-11-02 21:11:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-02 21:11:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-02 21:11:24,705 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-11-02 21:11:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2022-11-02 21:11:24,706 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 48 [2022-11-02 21:11:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:24,706 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2022-11-02 21:11:24,707 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-11-02 21:11:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2022-11-02 21:11:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 21:11:24,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:24,708 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-11-02 21:11:24,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:11:24,708 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:24,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1665628399, now seen corresponding path program 1 times [2022-11-02 21:11:24,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:24,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117434127] [2022-11-02 21:11:24,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:24,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:24,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117434127] [2022-11-02 21:11:24,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117434127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:24,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:24,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:24,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749562684] [2022-11-02 21:11:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:24,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:24,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:24,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:24,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:24,780 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-11-02 21:11:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:24,840 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2022-11-02 21:11:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:24,841 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-11-02 21:11:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:24,842 INFO L225 Difference]: With dead ends: 141 [2022-11-02 21:11:24,842 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 21:11:24,842 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-11-02 21:11:24,842 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:24,843 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.1s Time] [2022-11-02 21:11:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 21:11:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-11-02 21:11:24,846 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-11-02 21:11:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-11-02 21:11:24,847 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 49 [2022-11-02 21:11:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:24,847 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-11-02 21:11:24,847 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-11-02 21:11:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-11-02 21:11:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 21:11:24,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:24,848 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-11-02 21:11:24,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:11:24,848 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:24,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1923793837, now seen corresponding path program 1 times [2022-11-02 21:11:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:24,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309914636] [2022-11-02 21:11:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:24,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:24,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309914636] [2022-11-02 21:11:24,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309914636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:24,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:24,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:11:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478125512] [2022-11-02 21:11:24,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:24,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:11:24,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:24,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:11:24,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:11:24,987 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-11-02 21:11:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:25,126 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2022-11-02 21:11:25,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:11:25,127 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-11-02 21:11:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:25,128 INFO L225 Difference]: With dead ends: 132 [2022-11-02 21:11:25,128 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 21:11:25,128 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-11-02 21:11:25,129 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 106 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-02 21:11:25,130 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-11-02 21:11:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 21:11:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-02 21:11:25,132 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-11-02 21:11:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2022-11-02 21:11:25,133 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 49 [2022-11-02 21:11:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:25,133 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2022-11-02 21:11:25,134 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-11-02 21:11:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2022-11-02 21:11:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 21:11:25,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:25,135 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-11-02 21:11:25,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:11:25,135 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash -635303633, now seen corresponding path program 1 times [2022-11-02 21:11:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:25,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951206176] [2022-11-02 21:11:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:25,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:25,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951206176] [2022-11-02 21:11:25,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951206176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:25,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:25,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:25,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032197458] [2022-11-02 21:11:25,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:25,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:25,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:25,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:25,224 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-11-02 21:11:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:25,287 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-11-02 21:11:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:11:25,288 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-11-02 21:11:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:25,289 INFO L225 Difference]: With dead ends: 110 [2022-11-02 21:11:25,289 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 21:11:25,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:25,291 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-11-02 21:11:25,292 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-11-02 21:11:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 21:11:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-02 21:11:25,300 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-11-02 21:11:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2022-11-02 21:11:25,301 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 49 [2022-11-02 21:11:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:25,302 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2022-11-02 21:11:25,302 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-11-02 21:11:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2022-11-02 21:11:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 21:11:25,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:25,303 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-11-02 21:11:25,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:11:25,303 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:25,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:25,304 INFO L85 PathProgramCache]: Analyzing trace with hash -870094681, now seen corresponding path program 1 times [2022-11-02 21:11:25,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:25,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205563785] [2022-11-02 21:11:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:25,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:25,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:25,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205563785] [2022-11-02 21:11:25,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205563785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:25,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:25,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:11:25,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229873960] [2022-11-02 21:11:25,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:25,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:25,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:25,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:25,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:25,436 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-11-02 21:11:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:25,521 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-11-02 21:11:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:11:25,521 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-11-02 21:11:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:25,523 INFO L225 Difference]: With dead ends: 108 [2022-11-02 21:11:25,523 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 21:11:25,524 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-11-02 21:11:25,524 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:25,525 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.1s Time] [2022-11-02 21:11:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 21:11:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-02 21:11:25,529 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-11-02 21:11:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2022-11-02 21:11:25,530 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 50 [2022-11-02 21:11:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:25,531 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2022-11-02 21:11:25,531 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-11-02 21:11:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-11-02 21:11:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 21:11:25,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:25,534 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-11-02 21:11:25,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:11:25,535 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:25,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1424240836, now seen corresponding path program 1 times [2022-11-02 21:11:25,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:25,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235147435] [2022-11-02 21:11:25,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:25,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:25,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:25,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235147435] [2022-11-02 21:11:25,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235147435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:25,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:25,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:11:25,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164727367] [2022-11-02 21:11:25,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:25,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:11:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:25,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:11:25,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:11:25,738 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-11-02 21:11:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:25,819 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2022-11-02 21:11:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:11:25,820 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-11-02 21:11:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:25,821 INFO L225 Difference]: With dead ends: 108 [2022-11-02 21:11:25,821 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 21:11:25,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:11:25,824 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 32 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:25,824 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.1s Time] [2022-11-02 21:11:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 21:11:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-02 21:11:25,827 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-11-02 21:11:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2022-11-02 21:11:25,827 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 51 [2022-11-02 21:11:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:25,828 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2022-11-02 21:11:25,828 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-11-02 21:11:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-11-02 21:11:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 21:11:25,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:25,833 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-11-02 21:11:25,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:11:25,834 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:11:25,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash -613501158, now seen corresponding path program 1 times [2022-11-02 21:11:25,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:25,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798741400] [2022-11-02 21:11:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:11:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:25,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:25,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798741400] [2022-11-02 21:11:25,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798741400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:25,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:25,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:11:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792371794] [2022-11-02 21:11:25,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:25,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:11:25,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:25,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:11:25,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:11:25,915 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-11-02 21:11:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:25,952 INFO L93 Difference]: Finished difference Result 83 states and 82 transitions. [2022-11-02 21:11:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:25,953 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-11-02 21:11:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:25,954 INFO L225 Difference]: With dead ends: 83 [2022-11-02 21:11:25,954 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 21:11:25,954 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-11-02 21:11:25,955 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-11-02 21:11:25,955 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-11-02 21:11:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 21:11:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 21:11:25,956 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-11-02 21:11:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 21:11:25,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-11-02 21:11:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:25,956 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:11:25,957 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-11-02 21:11:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 21:11:25,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 21:11:25,960 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-11-02 21:11:25,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-11-02 21:11:25,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:11:25,966 INFO L444 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-11-02 21:11:25,969 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:11:25,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:11:25 BoogieIcfgContainer [2022-11-02 21:11:25,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:11:25,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:11:25,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:11:25,975 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:11:25,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:20" (3/4) ... [2022-11-02 21:11:25,979 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 21:11:25,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2022-11-02 21:11:25,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2022-11-02 21:11:25,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-11-02 21:11:25,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-02 21:11:25,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2022-11-02 21:11:25,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-02 21:11:25,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-11-02 21:11:26,006 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2022-11-02 21:11:26,007 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-02 21:11:26,008 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 21:11:26,009 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 21:11:26,137 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:11:26,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:11:26,142 INFO L158 Benchmark]: Toolchain (without parser) took 7810.24ms. Allocated memory was 98.6MB in the beginning and 176.2MB in the end (delta: 77.6MB). Free memory was 56.9MB in the beginning and 73.2MB in the end (delta: -16.3MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2022-11-02 21:11:26,142 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 98.6MB. Free memory was 73.5MB in the beginning and 73.5MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:11:26,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.95ms. Allocated memory was 98.6MB in the beginning and 142.6MB in the end (delta: 44.0MB). Free memory was 56.7MB in the beginning and 105.9MB in the end (delta: -49.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 21:11:26,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.59ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 102.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:11:26,143 INFO L158 Benchmark]: Boogie Preprocessor took 39.76ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 99.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:11:26,143 INFO L158 Benchmark]: RCFGBuilder took 1011.72ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 57.2MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-11-02 21:11:26,144 INFO L158 Benchmark]: TraceAbstraction took 5965.96ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 56.7MB in the beginning and 84.0MB in the end (delta: -27.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-11-02 21:11:26,146 INFO L158 Benchmark]: Witness Printer took 162.14ms. Allocated memory is still 176.2MB. Free memory was 84.0MB in the beginning and 73.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 21:11:26,152 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.24ms. Allocated memory is still 98.6MB. Free memory was 73.5MB in the beginning and 73.5MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.95ms. Allocated memory was 98.6MB in the beginning and 142.6MB in the end (delta: 44.0MB). Free memory was 56.7MB in the beginning and 105.9MB in the end (delta: -49.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.59ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 102.2MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.76ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 99.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1011.72ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 57.2MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5965.96ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 56.7MB in the beginning and 84.0MB in the end (delta: -27.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 162.14ms. Allocated memory is still 176.2MB. Free memory was 84.0MB in the beginning and 73.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. 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: 5.9s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2899 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2869 mSDsluCounter, 8313 SdHoareTripleChecker+Invalid, 1.5s 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, 3587 mSDtfsCounter, 1739 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 113 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 866 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 843 ConstructedInterpolants, 0 QuantifiedInterpolants, 2161 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-11-02 21:11:26,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e22b0c-46f7-4250-812c-919ee537e1fc/bin/uautomizer-Dbtcem3rbc/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