./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/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_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/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_7dfa1e6d-f12b-40de-9022-3e753599afd0/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 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa --- 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:01:28,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:01:28,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:01:28,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:01:28,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:01:28,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:01:28,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:01:28,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:01:28,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:01:28,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:01:28,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:01:28,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:01:28,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:01:28,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:01:28,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:01:28,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:01:28,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:01:28,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:01:28,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:01:28,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:01:28,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:01:28,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:01:28,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:01:28,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:01:28,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:01:28,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:01:28,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:01:28,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:01:28,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:01:28,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:01:28,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:01:28,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:01:28,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:01:28,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:01:28,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:01:28,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:01:28,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:01:28,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:01:28,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:01:28,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:01:28,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:01:28,822 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 21:01:28,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:01:28,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:01:28,864 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:01:28,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:01:28,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:01:28,865 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:01:28,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:01:28,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:01:28,866 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:01:28,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:01:28,867 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:01:28,867 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:01:28,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:01:28,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:01:28,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:01:28,868 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 21:01:28,868 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 21:01:28,868 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 21:01:28,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:01:28,869 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:01:28,869 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:01:28,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:01:28,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:01:28,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:01:28,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:01:28,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:01:28,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:01:28,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:01:28,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:01:28,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:01:28,871 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_7dfa1e6d-f12b-40de-9022-3e753599afd0/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_7dfa1e6d-f12b-40de-9022-3e753599afd0/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 -> 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa [2022-11-02 21:01:29,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:01:29,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:01:29,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:01:29,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:01:29,204 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:01:29,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2022-11-02 21:01:29,281 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/data/4fb626dc1/dc614a0bba6e4a5eb991d406cc863a9b/FLAG1f3df7bb2 [2022-11-02 21:01:29,898 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:01:29,902 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2022-11-02 21:01:29,921 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/data/4fb626dc1/dc614a0bba6e4a5eb991d406cc863a9b/FLAG1f3df7bb2 [2022-11-02 21:01:30,176 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/data/4fb626dc1/dc614a0bba6e4a5eb991d406cc863a9b [2022-11-02 21:01:30,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:01:30,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:01:30,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:01:30,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:01:30,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:01:30,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4ca048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30, skipping insertion in model container [2022-11-02 21:01:30,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:01:30,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:01:30,454 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_7dfa1e6d-f12b-40de-9022-3e753599afd0/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2022-11-02 21:01:30,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:01:30,569 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:01:30,584 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_7dfa1e6d-f12b-40de-9022-3e753599afd0/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2022-11-02 21:01:30,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:01:30,664 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:01:30,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30 WrapperNode [2022-11-02 21:01:30,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:01:30,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:01:30,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:01:30,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:01:30,673 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:01:30" (1/1) ... [2022-11-02 21:01:30,687 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:01:30" (1/1) ... [2022-11-02 21:01:30,740 INFO L138 Inliner]: procedures = 38, calls = 62, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 916 [2022-11-02 21:01:30,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:01:30,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:01:30,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:01:30,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:01:30,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,779 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:01:30,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:01:30,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:01:30,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:01:30,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (1/1) ... [2022-11-02 21:01:30,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:01:30,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:30,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:01:30,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:01:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:01:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-11-02 21:01:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-11-02 21:01:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-02 21:01:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-02 21:01:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-02 21:01:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-02 21:01:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 21:01:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 21:01:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:01:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 21:01:30,890 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 21:01:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:01:30,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:01:31,079 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:01:31,081 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:01:31,115 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,236 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-02 21:01:31,237 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-02 21:01:31,237 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,258 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-02 21:01:31,259 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-02 21:01:31,277 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,279 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,285 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,293 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,295 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,299 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,301 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,302 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,307 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,865 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2022-11-02 21:01:31,865 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2022-11-02 21:01:31,865 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##171: assume !false; [2022-11-02 21:01:31,866 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##170: assume false; [2022-11-02 21:01:31,866 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume !false; [2022-11-02 21:01:31,866 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume false; [2022-11-02 21:01:31,866 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !false; [2022-11-02 21:01:31,866 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume false; [2022-11-02 21:01:31,866 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2022-11-02 21:01:31,866 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2022-11-02 21:01:31,867 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-11-02 21:01:31,867 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-11-02 21:01:31,867 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##109: assume false; [2022-11-02 21:01:31,867 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##110: assume !false; [2022-11-02 21:01:31,867 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##119: assume !false; [2022-11-02 21:01:31,867 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##118: assume false; [2022-11-02 21:01:31,867 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##122: assume false; [2022-11-02 21:01:31,868 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##123: assume !false; [2022-11-02 21:01:31,869 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:01:31,898 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-02 21:01:31,898 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-02 21:01:31,905 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:01:31,913 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:01:31,913 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:01:31,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:01:31 BoogieIcfgContainer [2022-11-02 21:01:31,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:01:31,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:01:31,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:01:31,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:01:31,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:01:30" (1/3) ... [2022-11-02 21:01:31,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc1d1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:01:31, skipping insertion in model container [2022-11-02 21:01:31,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:01:30" (2/3) ... [2022-11-02 21:01:31,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc1d1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:01:31, skipping insertion in model container [2022-11-02 21:01:31,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:01:31" (3/3) ... [2022-11-02 21:01:31,925 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2022-11-02 21:01:31,943 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:01:31,943 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 21:01:32,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:01:32,024 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;@3d3070ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:01:32,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 21:01:32,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 193 states have (on average 1.4870466321243523) internal successors, (287), 215 states have internal predecessors, (287), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-02 21:01:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 21:01:32,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:32,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:32,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:32,052 INFO L85 PathProgramCache]: Analyzing trace with hash -379437591, now seen corresponding path program 1 times [2022-11-02 21:01:32,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:32,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235676996] [2022-11-02 21:01:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:32,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:32,399 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:01:32,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:32,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235676996] [2022-11-02 21:01:32,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235676996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:32,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:32,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243666103] [2022-11-02 21:01:32,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:32,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:32,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:32,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:32,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:32,446 INFO L87 Difference]: Start difference. First operand has 238 states, 193 states have (on average 1.4870466321243523) internal successors, (287), 215 states have internal predecessors, (287), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) 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:01:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:32,511 INFO L93 Difference]: Finished difference Result 237 states and 338 transitions. [2022-11-02 21:01:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:32,514 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:01:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:32,524 INFO L225 Difference]: With dead ends: 237 [2022-11-02 21:01:32,525 INFO L226 Difference]: Without dead ends: 235 [2022-11-02 21:01:32,526 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:01:32,529 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 194 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:32,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 448 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:32,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-02 21:01:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2022-11-02 21:01:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 191 states have (on average 1.4607329842931938) internal successors, (279), 211 states have internal predecessors, (279), 37 states have call successors, (37), 5 states have call predecessors, (37), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-02 21:01:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 335 transitions. [2022-11-02 21:01:32,604 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 335 transitions. Word has length 8 [2022-11-02 21:01:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:32,606 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 335 transitions. [2022-11-02 21:01:32,607 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:01:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 335 transitions. [2022-11-02 21:01:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:01:32,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:32,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:32,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:01:32,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash 229440230, now seen corresponding path program 1 times [2022-11-02 21:01:32,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:32,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698165948] [2022-11-02 21:01:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:32,666 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:01:32,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:32,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698165948] [2022-11-02 21:01:32,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698165948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:32,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:32,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:01:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470990020] [2022-11-02 21:01:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:32,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:32,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:32,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:32,670 INFO L87 Difference]: Start difference. First operand 234 states and 335 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:01:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:32,734 INFO L93 Difference]: Finished difference Result 233 states and 334 transitions. [2022-11-02 21:01:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:32,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-11-02 21:01:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:32,738 INFO L225 Difference]: With dead ends: 233 [2022-11-02 21:01:32,739 INFO L226 Difference]: Without dead ends: 229 [2022-11-02 21:01:32,739 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:01:32,740 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 214 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:32,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 392 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-02 21:01:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-11-02 21:01:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 206 states have internal predecessors, (266), 37 states have call successors, (37), 5 states have call predecessors, (37), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-02 21:01:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2022-11-02 21:01:32,756 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 11 [2022-11-02 21:01:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:32,757 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2022-11-02 21:01:32,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:01:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2022-11-02 21:01:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:01:32,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:32,758 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:01:32,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:01:32,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:32,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash 23733269, now seen corresponding path program 1 times [2022-11-02 21:01:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:32,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372457104] [2022-11-02 21:01:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:32,857 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:01:32,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:32,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372457104] [2022-11-02 21:01:32,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372457104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:32,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:32,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:32,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181654234] [2022-11-02 21:01:32,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:32,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:32,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:32,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:32,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:32,861 INFO L87 Difference]: Start difference. First operand 229 states and 322 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, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:32,992 INFO L93 Difference]: Finished difference Result 344 states and 482 transitions. [2022-11-02 21:01:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:32,994 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, (2), 2 states have call predecessors, (2), 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:01:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:32,997 INFO L225 Difference]: With dead ends: 344 [2022-11-02 21:01:32,997 INFO L226 Difference]: Without dead ends: 343 [2022-11-02 21:01:32,998 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:01:33,000 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 251 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:33,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 583 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-02 21:01:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 326. [2022-11-02 21:01:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 281 states have (on average 1.3629893238434163) internal successors, (383), 285 states have internal predecessors, (383), 37 states have call successors, (37), 9 states have call predecessors, (37), 7 states have return successors, (40), 32 states have call predecessors, (40), 27 states have call successors, (40) [2022-11-02 21:01:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 460 transitions. [2022-11-02 21:01:33,047 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 460 transitions. Word has length 18 [2022-11-02 21:01:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:33,047 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 460 transitions. [2022-11-02 21:01:33,047 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, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 460 transitions. [2022-11-02 21:01:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 21:01:33,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:33,048 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:01:33,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:01:33,049 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:33,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1035240094, now seen corresponding path program 1 times [2022-11-02 21:01:33,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:33,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202315482] [2022-11-02 21:01:33,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:33,189 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:01:33,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:33,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202315482] [2022-11-02 21:01:33,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202315482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:33,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:33,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413078611] [2022-11-02 21:01:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:33,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:33,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:33,193 INFO L87 Difference]: Start difference. First operand 326 states and 460 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:01:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:33,223 INFO L93 Difference]: Finished difference Result 512 states and 717 transitions. [2022-11-02 21:01:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:33,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2022-11-02 21:01:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:33,242 INFO L225 Difference]: With dead ends: 512 [2022-11-02 21:01:33,244 INFO L226 Difference]: Without dead ends: 512 [2022-11-02 21:01:33,246 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:01:33,248 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 273 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:33,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 479 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-11-02 21:01:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 485. [2022-11-02 21:01:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 423 states have (on average 1.3617021276595744) internal successors, (576), 424 states have internal predecessors, (576), 47 states have call successors, (47), 17 states have call predecessors, (47), 14 states have return successors, (61), 44 states have call predecessors, (61), 39 states have call successors, (61) [2022-11-02 21:01:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 684 transitions. [2022-11-02 21:01:33,284 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 684 transitions. Word has length 19 [2022-11-02 21:01:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:33,285 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 684 transitions. [2022-11-02 21:01:33,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:01:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 684 transitions. [2022-11-02 21:01:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 21:01:33,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:33,289 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] [2022-11-02 21:01:33,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:01:33,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:33,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1224032788, now seen corresponding path program 1 times [2022-11-02 21:01:33,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:33,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563835038] [2022-11-02 21:01:33,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:33,392 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:01:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:33,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563835038] [2022-11-02 21:01:33,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563835038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:33,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:33,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:33,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093190471] [2022-11-02 21:01:33,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:33,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:33,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:33,397 INFO L87 Difference]: Start difference. First operand 485 states and 684 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:01:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:33,446 INFO L93 Difference]: Finished difference Result 556 states and 772 transitions. [2022-11-02 21:01:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:33,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 22 [2022-11-02 21:01:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:33,450 INFO L225 Difference]: With dead ends: 556 [2022-11-02 21:01:33,450 INFO L226 Difference]: Without dead ends: 556 [2022-11-02 21:01:33,451 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:01:33,452 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 277 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:33,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 384 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-11-02 21:01:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 523. [2022-11-02 21:01:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 455 states have (on average 1.3604395604395605) internal successors, (619), 462 states have internal predecessors, (619), 49 states have call successors, (49), 20 states have call predecessors, (49), 18 states have return successors, (65), 42 states have call predecessors, (65), 42 states have call successors, (65) [2022-11-02 21:01:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 733 transitions. [2022-11-02 21:01:33,476 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 733 transitions. Word has length 22 [2022-11-02 21:01:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:33,477 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 733 transitions. [2022-11-02 21:01:33,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:01:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 733 transitions. [2022-11-02 21:01:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 21:01:33,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:33,479 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] [2022-11-02 21:01:33,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:01:33,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -222747689, now seen corresponding path program 1 times [2022-11-02 21:01:33,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:33,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879034731] [2022-11-02 21:01:33,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:33,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:33,569 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:01:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:33,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879034731] [2022-11-02 21:01:33,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879034731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:33,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:33,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:33,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695060059] [2022-11-02 21:01:33,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:33,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:33,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:33,573 INFO L87 Difference]: Start difference. First operand 523 states and 733 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:33,699 INFO L93 Difference]: Finished difference Result 803 states and 1126 transitions. [2022-11-02 21:01:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:33,700 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 21:01:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:33,729 INFO L225 Difference]: With dead ends: 803 [2022-11-02 21:01:33,730 INFO L226 Difference]: Without dead ends: 803 [2022-11-02 21:01:33,730 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:01:33,731 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 120 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:33,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 662 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2022-11-02 21:01:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 614. [2022-11-02 21:01:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 540 states have (on average 1.3685185185185185) internal successors, (739), 550 states have internal predecessors, (739), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 21:01:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 862 transitions. [2022-11-02 21:01:33,790 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 862 transitions. Word has length 27 [2022-11-02 21:01:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:33,791 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 862 transitions. [2022-11-02 21:01:33,791 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 862 transitions. [2022-11-02 21:01:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 21:01:33,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:33,793 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] [2022-11-02 21:01:33,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:01:33,794 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:33,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:33,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1446649383, now seen corresponding path program 1 times [2022-11-02 21:01:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:33,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109258698] [2022-11-02 21:01:33,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:33,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,010 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:01:34,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:34,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109258698] [2022-11-02 21:01:34,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109258698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:34,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:34,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:01:34,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247090361] [2022-11-02 21:01:34,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:34,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:01:34,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:34,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:01:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:01:34,013 INFO L87 Difference]: Start difference. First operand 614 states and 862 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:34,288 INFO L93 Difference]: Finished difference Result 639 states and 882 transitions. [2022-11-02 21:01:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:01:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 21:01:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:34,294 INFO L225 Difference]: With dead ends: 639 [2022-11-02 21:01:34,295 INFO L226 Difference]: Without dead ends: 639 [2022-11-02 21:01:34,295 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:01:34,300 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 513 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:34,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 527 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-11-02 21:01:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 605. [2022-11-02 21:01:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 531 states have (on average 1.3521657250470809) internal successors, (718), 541 states have internal predecessors, (718), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 21:01:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 841 transitions. [2022-11-02 21:01:34,342 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 841 transitions. Word has length 28 [2022-11-02 21:01:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:34,344 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 841 transitions. [2022-11-02 21:01:34,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 841 transitions. [2022-11-02 21:01:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 21:01:34,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:34,354 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:01:34,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:01:34,354 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash -266296252, now seen corresponding path program 1 times [2022-11-02 21:01:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:34,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993989905] [2022-11-02 21:01:34,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:34,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:01:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,450 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:01:34,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:34,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993989905] [2022-11-02 21:01:34,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993989905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:34,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:34,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:01:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248968915] [2022-11-02 21:01:34,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:34,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:01:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:01:34,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:01:34,452 INFO L87 Difference]: Start difference. First operand 605 states and 841 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:01:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:34,625 INFO L93 Difference]: Finished difference Result 645 states and 893 transitions. [2022-11-02 21:01:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:34,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-11-02 21:01:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:34,630 INFO L225 Difference]: With dead ends: 645 [2022-11-02 21:01:34,631 INFO L226 Difference]: Without dead ends: 645 [2022-11-02 21:01:34,631 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:01:34,632 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 64 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:34,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 735 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-11-02 21:01:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 626. [2022-11-02 21:01:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 552 states have (on average 1.3496376811594204) internal successors, (745), 561 states have internal predecessors, (745), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 21:01:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 868 transitions. [2022-11-02 21:01:34,667 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 868 transitions. Word has length 29 [2022-11-02 21:01:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:34,668 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 868 transitions. [2022-11-02 21:01:34,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:01:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 868 transitions. [2022-11-02 21:01:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 21:01:34,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:34,673 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] [2022-11-02 21:01:34,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:01:34,673 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:34,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash 786936120, now seen corresponding path program 1 times [2022-11-02 21:01:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:34,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755220012] [2022-11-02 21:01:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:01:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,850 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:01:34,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:34,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755220012] [2022-11-02 21:01:34,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755220012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:34,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:34,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677933242] [2022-11-02 21:01:34,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:34,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:34,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:34,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:34,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:34,853 INFO L87 Difference]: Start difference. First operand 626 states and 868 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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:01:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:35,118 INFO L93 Difference]: Finished difference Result 645 states and 892 transitions. [2022-11-02 21:01:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:35,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2022-11-02 21:01:35,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:35,122 INFO L225 Difference]: With dead ends: 645 [2022-11-02 21:01:35,122 INFO L226 Difference]: Without dead ends: 645 [2022-11-02 21:01:35,122 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:01:35,126 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 393 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:35,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 701 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:35,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-11-02 21:01:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 626. [2022-11-02 21:01:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 552 states have (on average 1.3478260869565217) internal successors, (744), 561 states have internal predecessors, (744), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 21:01:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 867 transitions. [2022-11-02 21:01:35,149 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 867 transitions. Word has length 30 [2022-11-02 21:01:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:35,150 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 867 transitions. [2022-11-02 21:01:35,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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:01:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 867 transitions. [2022-11-02 21:01:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 21:01:35,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:35,151 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] [2022-11-02 21:01:35,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:01:35,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1995000776, now seen corresponding path program 1 times [2022-11-02 21:01:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:35,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727207304] [2022-11-02 21:01:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,231 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:01:35,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:35,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727207304] [2022-11-02 21:01:35,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727207304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:35,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:35,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:35,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440611559] [2022-11-02 21:01:35,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:35,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:35,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:35,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:35,234 INFO L87 Difference]: Start difference. First operand 626 states and 867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:35,302 INFO L93 Difference]: Finished difference Result 638 states and 883 transitions. [2022-11-02 21:01:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 21:01:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:35,307 INFO L225 Difference]: With dead ends: 638 [2022-11-02 21:01:35,311 INFO L226 Difference]: Without dead ends: 638 [2022-11-02 21:01:35,311 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:01:35,312 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 16 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:35,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 547 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-11-02 21:01:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 637. [2022-11-02 21:01:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 563 states have (on average 1.3463587921847247) internal successors, (758), 571 states have internal predecessors, (758), 51 states have call successors, (51), 23 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 21:01:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 881 transitions. [2022-11-02 21:01:35,331 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 881 transitions. Word has length 30 [2022-11-02 21:01:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:35,333 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 881 transitions. [2022-11-02 21:01:35,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 881 transitions. [2022-11-02 21:01:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 21:01:35,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:35,335 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] [2022-11-02 21:01:35,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:01:35,335 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2060099377, now seen corresponding path program 1 times [2022-11-02 21:01:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:35,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663867540] [2022-11-02 21:01:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:01:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,503 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:01:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:35,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663867540] [2022-11-02 21:01:35,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663867540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:35,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:35,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854989141] [2022-11-02 21:01:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:35,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:35,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:35,506 INFO L87 Difference]: Start difference. First operand 637 states and 881 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:01:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:35,800 INFO L93 Difference]: Finished difference Result 656 states and 905 transitions. [2022-11-02 21:01:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:35,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2022-11-02 21:01:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:35,804 INFO L225 Difference]: With dead ends: 656 [2022-11-02 21:01:35,804 INFO L226 Difference]: Without dead ends: 656 [2022-11-02 21:01:35,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:35,805 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 374 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:35,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 911 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-11-02 21:01:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 637. [2022-11-02 21:01:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 563 states have (on average 1.344582593250444) internal successors, (757), 571 states have internal predecessors, (757), 51 states have call successors, (51), 23 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2022-11-02 21:01:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 880 transitions. [2022-11-02 21:01:35,825 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 880 transitions. Word has length 31 [2022-11-02 21:01:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:35,826 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 880 transitions. [2022-11-02 21:01:35,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:01:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 880 transitions. [2022-11-02 21:01:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:01:35,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:35,828 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] [2022-11-02 21:01:35,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:01:35,829 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:35,829 INFO L85 PathProgramCache]: Analyzing trace with hash -477345279, now seen corresponding path program 1 times [2022-11-02 21:01:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:35,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332579029] [2022-11-02 21:01:35,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:01:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,892 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:01:35,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:35,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332579029] [2022-11-02 21:01:35,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332579029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:35,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:35,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:01:35,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881361305] [2022-11-02 21:01:35,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:35,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:35,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:35,895 INFO L87 Difference]: Start difference. First operand 637 states and 880 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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:01:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:36,043 INFO L93 Difference]: Finished difference Result 665 states and 914 transitions. [2022-11-02 21:01:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 32 [2022-11-02 21:01:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:36,047 INFO L225 Difference]: With dead ends: 665 [2022-11-02 21:01:36,047 INFO L226 Difference]: Without dead ends: 652 [2022-11-02 21:01:36,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:01:36,048 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 52 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:36,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1069 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-11-02 21:01:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 635. [2022-11-02 21:01:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 562 states have (on average 1.3434163701067616) internal successors, (755), 570 states have internal predecessors, (755), 50 states have call successors, (50), 23 states have call predecessors, (50), 22 states have return successors, (71), 42 states have call predecessors, (71), 43 states have call successors, (71) [2022-11-02 21:01:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 876 transitions. [2022-11-02 21:01:36,065 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 876 transitions. Word has length 32 [2022-11-02 21:01:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:36,066 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 876 transitions. [2022-11-02 21:01:36,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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:01:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 876 transitions. [2022-11-02 21:01:36,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 21:01:36,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:36,067 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:01:36,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:01:36,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1919528188, now seen corresponding path program 1 times [2022-11-02 21:01:36,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:36,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232380707] [2022-11-02 21:01:36,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:36,112 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:01:36,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:36,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232380707] [2022-11-02 21:01:36,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232380707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:36,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:36,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:01:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195012194] [2022-11-02 21:01:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:36,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:01:36,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:36,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:01:36,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:01:36,114 INFO L87 Difference]: Start difference. First operand 635 states and 876 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:36,163 INFO L93 Difference]: Finished difference Result 643 states and 887 transitions. [2022-11-02 21:01:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:01:36,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:01:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:36,166 INFO L225 Difference]: With dead ends: 643 [2022-11-02 21:01:36,167 INFO L226 Difference]: Without dead ends: 643 [2022-11-02 21:01:36,167 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:01:36,168 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 5 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:36,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 558 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:01:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-11-02 21:01:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2022-11-02 21:01:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 570 states have (on average 1.343859649122807) internal successors, (766), 578 states have internal predecessors, (766), 50 states have call successors, (50), 23 states have call predecessors, (50), 22 states have return successors, (71), 42 states have call predecessors, (71), 43 states have call successors, (71) [2022-11-02 21:01:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 887 transitions. [2022-11-02 21:01:36,197 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 887 transitions. Word has length 34 [2022-11-02 21:01:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:36,197 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 887 transitions. [2022-11-02 21:01:36,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:01:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 887 transitions. [2022-11-02 21:01:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 21:01:36,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:36,199 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] [2022-11-02 21:01:36,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:01:36,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash 197237323, now seen corresponding path program 1 times [2022-11-02 21:01:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:36,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101168465] [2022-11-02 21:01:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:36,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:36,276 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:01:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:36,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101168465] [2022-11-02 21:01:36,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101168465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:36,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:36,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:01:36,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057271952] [2022-11-02 21:01:36,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:36,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:01:36,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:36,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:01:36,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:36,279 INFO L87 Difference]: Start difference. First operand 643 states and 887 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:36,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:36,547 INFO L93 Difference]: Finished difference Result 468 states and 616 transitions. [2022-11-02 21:01:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:01:36,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-11-02 21:01:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:36,550 INFO L225 Difference]: With dead ends: 468 [2022-11-02 21:01:36,550 INFO L226 Difference]: Without dead ends: 468 [2022-11-02 21:01:36,550 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:01:36,551 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 382 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:36,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 824 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-02 21:01:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 427. [2022-11-02 21:01:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 375 states have (on average 1.312) internal successors, (492), 383 states have internal predecessors, (492), 35 states have call successors, (35), 16 states have call predecessors, (35), 16 states have return successors, (39), 28 states have call predecessors, (39), 28 states have call successors, (39) [2022-11-02 21:01:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 566 transitions. [2022-11-02 21:01:36,563 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 566 transitions. Word has length 38 [2022-11-02 21:01:36,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:36,563 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 566 transitions. [2022-11-02 21:01:36,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 566 transitions. [2022-11-02 21:01:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 21:01:36,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:36,565 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:01:36,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:01:36,566 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1089851695, now seen corresponding path program 1 times [2022-11-02 21:01:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:36,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032361011] [2022-11-02 21:01:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:36,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:36,749 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:01:36,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:36,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032361011] [2022-11-02 21:01:36,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032361011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:36,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:36,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:01:36,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687742769] [2022-11-02 21:01:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:36,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:36,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:36,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:36,751 INFO L87 Difference]: Start difference. First operand 427 states and 566 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:36,988 INFO L93 Difference]: Finished difference Result 422 states and 554 transitions. [2022-11-02 21:01:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:36,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-02 21:01:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:36,991 INFO L225 Difference]: With dead ends: 422 [2022-11-02 21:01:36,991 INFO L226 Difference]: Without dead ends: 422 [2022-11-02 21:01:36,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:01:36,992 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 74 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:36,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1575 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-02 21:01:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 410. [2022-11-02 21:01:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 359 states have (on average 1.3008356545961002) internal successors, (467), 366 states have internal predecessors, (467), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (39), 28 states have call predecessors, (39), 28 states have call successors, (39) [2022-11-02 21:01:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 540 transitions. [2022-11-02 21:01:37,006 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 540 transitions. Word has length 41 [2022-11-02 21:01:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:37,006 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 540 transitions. [2022-11-02 21:01:37,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 540 transitions. [2022-11-02 21:01:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 21:01:37,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:37,008 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] [2022-11-02 21:01:37,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:01:37,009 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash 738484898, now seen corresponding path program 1 times [2022-11-02 21:01:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:37,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562789348] [2022-11-02 21:01:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:01:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:37,138 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:01:37,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:37,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562789348] [2022-11-02 21:01:37,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562789348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:37,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:37,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:01:37,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711958190] [2022-11-02 21:01:37,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:37,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:37,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:37,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:37,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:37,141 INFO L87 Difference]: Start difference. First operand 410 states and 540 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 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:01:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:37,503 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2022-11-02 21:01:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:01:37,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 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 40 [2022-11-02 21:01:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:37,506 INFO L225 Difference]: With dead ends: 447 [2022-11-02 21:01:37,506 INFO L226 Difference]: Without dead ends: 447 [2022-11-02 21:01:37,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:01:37,507 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 357 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:37,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1128 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:01:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-02 21:01:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 410. [2022-11-02 21:01:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 359 states have (on average 1.2952646239554317) internal successors, (465), 366 states have internal predecessors, (465), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (39), 28 states have call predecessors, (39), 28 states have call successors, (39) [2022-11-02 21:01:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 538 transitions. [2022-11-02 21:01:37,522 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 538 transitions. Word has length 40 [2022-11-02 21:01:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:37,523 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 538 transitions. [2022-11-02 21:01:37,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 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:01:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 538 transitions. [2022-11-02 21:01:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 21:01:37,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:37,524 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:01:37,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:01:37,525 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:37,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1982956471, now seen corresponding path program 1 times [2022-11-02 21:01:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:37,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051731430] [2022-11-02 21:01:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:37,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:37,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:01:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:37,623 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:01:37,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:37,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051731430] [2022-11-02 21:01:37,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051731430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:37,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:37,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024621717] [2022-11-02 21:01:37,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:37,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:37,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:37,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:37,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:37,626 INFO L87 Difference]: Start difference. First operand 410 states and 538 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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:01:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:37,779 INFO L93 Difference]: Finished difference Result 436 states and 566 transitions. [2022-11-02 21:01:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:01:37,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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 41 [2022-11-02 21:01:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:37,781 INFO L225 Difference]: With dead ends: 436 [2022-11-02 21:01:37,781 INFO L226 Difference]: Without dead ends: 404 [2022-11-02 21:01:37,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:01:37,783 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 74 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:37,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1314 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-11-02 21:01:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2022-11-02 21:01:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 345 states have (on average 1.2927536231884058) internal successors, (446), 351 states have internal predecessors, (446), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (37), 27 states have call predecessors, (37), 26 states have call successors, (37) [2022-11-02 21:01:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 515 transitions. [2022-11-02 21:01:37,796 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 515 transitions. Word has length 41 [2022-11-02 21:01:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:37,796 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 515 transitions. [2022-11-02 21:01:37,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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:01:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 515 transitions. [2022-11-02 21:01:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 21:01:37,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:37,797 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:01:37,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:01:37,798 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:37,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash -13657420, now seen corresponding path program 1 times [2022-11-02 21:01:37,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:37,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592382784] [2022-11-02 21:01:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:37,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:37,968 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:01:37,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:37,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592382784] [2022-11-02 21:01:37,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592382784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:37,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:37,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387702869] [2022-11-02 21:01:37,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:37,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:37,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:37,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:37,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:37,971 INFO L87 Difference]: Start difference. First operand 392 states and 515 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:38,285 INFO L93 Difference]: Finished difference Result 404 states and 528 transitions. [2022-11-02 21:01:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:38,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-02 21:01:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:38,288 INFO L225 Difference]: With dead ends: 404 [2022-11-02 21:01:38,288 INFO L226 Difference]: Without dead ends: 404 [2022-11-02 21:01:38,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:38,289 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 315 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:38,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 899 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-11-02 21:01:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2022-11-02 21:01:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 345 states have (on average 1.289855072463768) internal successors, (445), 351 states have internal predecessors, (445), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (37), 27 states have call predecessors, (37), 26 states have call successors, (37) [2022-11-02 21:01:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 514 transitions. [2022-11-02 21:01:38,300 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 514 transitions. Word has length 43 [2022-11-02 21:01:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:38,300 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 514 transitions. [2022-11-02 21:01:38,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 514 transitions. [2022-11-02 21:01:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 21:01:38,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:38,302 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:01:38,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:01:38,302 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:38,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1480101209, now seen corresponding path program 1 times [2022-11-02 21:01:38,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:38,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762976117] [2022-11-02 21:01:38,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:38,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:01:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,415 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:01:38,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:38,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762976117] [2022-11-02 21:01:38,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762976117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:38,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:38,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622418916] [2022-11-02 21:01:38,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:38,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:38,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:38,417 INFO L87 Difference]: Start difference. First operand 392 states and 514 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:01:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:38,746 INFO L93 Difference]: Finished difference Result 411 states and 538 transitions. [2022-11-02 21:01:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:01:38,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 42 [2022-11-02 21:01:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:38,749 INFO L225 Difference]: With dead ends: 411 [2022-11-02 21:01:38,749 INFO L226 Difference]: Without dead ends: 411 [2022-11-02 21:01:38,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:01:38,750 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 334 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:38,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 902 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:01:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-11-02 21:01:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 384. [2022-11-02 21:01:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 338 states have (on average 1.2810650887573964) internal successors, (433), 344 states have internal predecessors, (433), 32 states have call successors, (32), 14 states have call predecessors, (32), 13 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2022-11-02 21:01:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 501 transitions. [2022-11-02 21:01:38,762 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 501 transitions. Word has length 42 [2022-11-02 21:01:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:38,763 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 501 transitions. [2022-11-02 21:01:38,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:01:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 501 transitions. [2022-11-02 21:01:38,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 21:01:38,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:38,764 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:01:38,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:01:38,764 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:38,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2093894745, now seen corresponding path program 1 times [2022-11-02 21:01:38,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:38,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074737434] [2022-11-02 21:01:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:38,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:01:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,818 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:01:38,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:38,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074737434] [2022-11-02 21:01:38,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074737434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:38,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:38,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:01:38,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922406020] [2022-11-02 21:01:38,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:38,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:01:38,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:01:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:01:38,821 INFO L87 Difference]: Start difference. First operand 384 states and 501 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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:01:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:38,985 INFO L93 Difference]: Finished difference Result 397 states and 512 transitions. [2022-11-02 21:01:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:38,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 42 [2022-11-02 21:01:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:38,987 INFO L225 Difference]: With dead ends: 397 [2022-11-02 21:01:38,987 INFO L226 Difference]: Without dead ends: 397 [2022-11-02 21:01:38,988 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:01:38,988 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 80 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:38,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 687 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-02 21:01:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 381. [2022-11-02 21:01:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 336 states have (on average 1.2738095238095237) internal successors, (428), 341 states have internal predecessors, (428), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2022-11-02 21:01:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 495 transitions. [2022-11-02 21:01:38,999 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 495 transitions. Word has length 42 [2022-11-02 21:01:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:39,000 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 495 transitions. [2022-11-02 21:01:39,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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:01:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 495 transitions. [2022-11-02 21:01:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 21:01:39,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:39,001 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:01:39,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:01:39,002 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash -34042315, now seen corresponding path program 1 times [2022-11-02 21:01:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:39,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089436755] [2022-11-02 21:01:39,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:01:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,149 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:01:39,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:39,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089436755] [2022-11-02 21:01:39,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089436755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:39,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:39,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:01:39,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705791423] [2022-11-02 21:01:39,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:39,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:01:39,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:39,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:01:39,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:01:39,152 INFO L87 Difference]: Start difference. First operand 381 states and 495 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 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:01:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:39,436 INFO L93 Difference]: Finished difference Result 423 states and 547 transitions. [2022-11-02 21:01:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:01:39,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 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 43 [2022-11-02 21:01:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:39,438 INFO L225 Difference]: With dead ends: 423 [2022-11-02 21:01:39,438 INFO L226 Difference]: Without dead ends: 422 [2022-11-02 21:01:39,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:01:39,439 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 227 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:39,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1530 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-02 21:01:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 396. [2022-11-02 21:01:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 350 states have (on average 1.262857142857143) internal successors, (442), 355 states have internal predecessors, (442), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (42), 27 states have call predecessors, (42), 26 states have call successors, (42) [2022-11-02 21:01:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 515 transitions. [2022-11-02 21:01:39,450 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 515 transitions. Word has length 43 [2022-11-02 21:01:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:39,451 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 515 transitions. [2022-11-02 21:01:39,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 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:01:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 515 transitions. [2022-11-02 21:01:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 21:01:39,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:39,452 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:01:39,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:01:39,453 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:39,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash -33765485, now seen corresponding path program 1 times [2022-11-02 21:01:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:39,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301936687] [2022-11-02 21:01:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:01:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,561 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:01:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:39,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301936687] [2022-11-02 21:01:39,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301936687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:39,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:39,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:01:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257840071] [2022-11-02 21:01:39,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:39,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:01:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:39,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:01:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:01:39,563 INFO L87 Difference]: Start difference. First operand 396 states and 515 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 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:01:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:39,860 INFO L93 Difference]: Finished difference Result 419 states and 540 transitions. [2022-11-02 21:01:39,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:01:39,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 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 43 [2022-11-02 21:01:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:39,864 INFO L225 Difference]: With dead ends: 419 [2022-11-02 21:01:39,864 INFO L226 Difference]: Without dead ends: 409 [2022-11-02 21:01:39,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:39,865 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 49 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:39,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1649 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:01:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-02 21:01:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 393. [2022-11-02 21:01:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 347 states have (on average 1.2651296829971181) internal successors, (439), 353 states have internal predecessors, (439), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (41), 26 states have call predecessors, (41), 26 states have call successors, (41) [2022-11-02 21:01:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 511 transitions. [2022-11-02 21:01:39,878 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 511 transitions. Word has length 43 [2022-11-02 21:01:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:39,879 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 511 transitions. [2022-11-02 21:01:39,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 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:01:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2022-11-02 21:01:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 21:01:39,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:39,881 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:01:39,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:01:39,882 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1181888463, now seen corresponding path program 1 times [2022-11-02 21:01:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:39,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421561794] [2022-11-02 21:01:39,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 21:01:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,999 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:01:40,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421561794] [2022-11-02 21:01:40,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421561794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:40,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:40,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154109009] [2022-11-02 21:01:40,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:40,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:40,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:40,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:40,002 INFO L87 Difference]: Start difference. First operand 393 states and 511 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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:01:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:40,286 INFO L93 Difference]: Finished difference Result 409 states and 526 transitions. [2022-11-02 21:01:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:01:40,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 44 [2022-11-02 21:01:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:40,288 INFO L225 Difference]: With dead ends: 409 [2022-11-02 21:01:40,288 INFO L226 Difference]: Without dead ends: 397 [2022-11-02 21:01:40,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:40,289 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 384 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:40,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 837 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-02 21:01:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 377. [2022-11-02 21:01:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 333 states have (on average 1.2702702702702702) internal successors, (423), 338 states have internal predecessors, (423), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (35), 25 states have call predecessors, (35), 25 states have call successors, (35) [2022-11-02 21:01:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 488 transitions. [2022-11-02 21:01:40,299 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 488 transitions. Word has length 44 [2022-11-02 21:01:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:40,299 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 488 transitions. [2022-11-02 21:01:40,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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:01:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 488 transitions. [2022-11-02 21:01:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 21:01:40,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:40,301 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] [2022-11-02 21:01:40,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:01:40,301 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:40,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:40,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1424622961, now seen corresponding path program 1 times [2022-11-02 21:01:40,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:40,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704630632] [2022-11-02 21:01:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:40,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:40,381 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:01:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:40,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704630632] [2022-11-02 21:01:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704630632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:40,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:40,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:01:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319146763] [2022-11-02 21:01:40,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:40,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:01:40,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:01:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:01:40,383 INFO L87 Difference]: Start difference. First operand 377 states and 488 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:40,546 INFO L93 Difference]: Finished difference Result 468 states and 599 transitions. [2022-11-02 21:01:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:01:40,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-11-02 21:01:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:40,549 INFO L225 Difference]: With dead ends: 468 [2022-11-02 21:01:40,549 INFO L226 Difference]: Without dead ends: 468 [2022-11-02 21:01:40,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:01:40,550 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 160 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:40,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 747 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-02 21:01:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 430. [2022-11-02 21:01:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 381 states have (on average 1.2703412073490814) internal successors, (484), 385 states have internal predecessors, (484), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (41), 29 states have call predecessors, (41), 28 states have call successors, (41) [2022-11-02 21:01:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 557 transitions. [2022-11-02 21:01:40,562 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 557 transitions. Word has length 46 [2022-11-02 21:01:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:40,562 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 557 transitions. [2022-11-02 21:01:40,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 557 transitions. [2022-11-02 21:01:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 21:01:40,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:40,564 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:01:40,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:01:40,565 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:40,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1973534822, now seen corresponding path program 1 times [2022-11-02 21:01:40,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:40,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909886799] [2022-11-02 21:01:40,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:01:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:40,749 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:01:40,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:40,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909886799] [2022-11-02 21:01:40,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909886799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:40,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:40,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:01:40,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419272290] [2022-11-02 21:01:40,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:40,752 INFO L87 Difference]: Start difference. First operand 430 states and 557 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:40,995 INFO L93 Difference]: Finished difference Result 471 states and 604 transitions. [2022-11-02 21:01:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:01:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-11-02 21:01:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:40,998 INFO L225 Difference]: With dead ends: 471 [2022-11-02 21:01:40,998 INFO L226 Difference]: Without dead ends: 471 [2022-11-02 21:01:40,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:40,999 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 52 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:41,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1610 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-02 21:01:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 430. [2022-11-02 21:01:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 381 states have (on average 1.2650918635170603) internal successors, (482), 385 states have internal predecessors, (482), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (41), 29 states have call predecessors, (41), 28 states have call successors, (41) [2022-11-02 21:01:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 555 transitions. [2022-11-02 21:01:41,013 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 555 transitions. Word has length 48 [2022-11-02 21:01:41,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:41,014 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 555 transitions. [2022-11-02 21:01:41,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 555 transitions. [2022-11-02 21:01:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 21:01:41,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:41,016 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:01:41,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:01:41,016 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:41,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:41,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1518352747, now seen corresponding path program 1 times [2022-11-02 21:01:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:41,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361197691] [2022-11-02 21:01:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:41,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 21:01:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:41,122 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:01:41,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:41,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361197691] [2022-11-02 21:01:41,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361197691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:41,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:41,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:41,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040593793] [2022-11-02 21:01:41,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:41,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:41,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:41,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:41,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:41,125 INFO L87 Difference]: Start difference. First operand 430 states and 555 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 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:01:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:41,450 INFO L93 Difference]: Finished difference Result 454 states and 581 transitions. [2022-11-02 21:01:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 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 48 [2022-11-02 21:01:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:41,452 INFO L225 Difference]: With dead ends: 454 [2022-11-02 21:01:41,452 INFO L226 Difference]: Without dead ends: 438 [2022-11-02 21:01:41,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:01:41,453 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 53 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:41,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1844 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:01:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-02 21:01:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 426. [2022-11-02 21:01:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 378 states have (on average 1.2645502645502646) internal successors, (478), 382 states have internal predecessors, (478), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (40), 28 states have call predecessors, (40), 27 states have call successors, (40) [2022-11-02 21:01:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 549 transitions. [2022-11-02 21:01:41,463 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 549 transitions. Word has length 48 [2022-11-02 21:01:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:41,464 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 549 transitions. [2022-11-02 21:01:41,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 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:01:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 549 transitions. [2022-11-02 21:01:41,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 21:01:41,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:41,465 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:01:41,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:01:41,466 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash 882823039, now seen corresponding path program 1 times [2022-11-02 21:01:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:41,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199332182] [2022-11-02 21:01:41,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:01:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:41,569 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:01:41,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:41,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199332182] [2022-11-02 21:01:41,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199332182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:41,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:41,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:41,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12018491] [2022-11-02 21:01:41,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:41,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:41,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:41,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:41,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:41,571 INFO L87 Difference]: Start difference. First operand 426 states and 549 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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:01:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:41,858 INFO L93 Difference]: Finished difference Result 450 states and 575 transitions. [2022-11-02 21:01:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:41,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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 49 [2022-11-02 21:01:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:41,861 INFO L225 Difference]: With dead ends: 450 [2022-11-02 21:01:41,861 INFO L226 Difference]: Without dead ends: 433 [2022-11-02 21:01:41,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:01:41,872 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 53 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:41,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1806 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-02 21:01:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 421. [2022-11-02 21:01:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 374 states have (on average 1.2647058823529411) internal successors, (473), 378 states have internal predecessors, (473), 30 states have call successors, (30), 16 states have call predecessors, (30), 16 states have return successors, (39), 27 states have call predecessors, (39), 26 states have call successors, (39) [2022-11-02 21:01:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 542 transitions. [2022-11-02 21:01:41,882 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 542 transitions. Word has length 49 [2022-11-02 21:01:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:41,882 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 542 transitions. [2022-11-02 21:01:41,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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:01:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 542 transitions. [2022-11-02 21:01:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 21:01:41,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:41,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:41,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:01:41,885 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash 163830842, now seen corresponding path program 1 times [2022-11-02 21:01:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:41,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283029808] [2022-11-02 21:01:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:41,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:01:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:42,001 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:01:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283029808] [2022-11-02 21:01:42,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283029808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:42,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:42,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566183771] [2022-11-02 21:01:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:42,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:42,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:42,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:42,004 INFO L87 Difference]: Start difference. First operand 421 states and 542 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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:01:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:42,285 INFO L93 Difference]: Finished difference Result 445 states and 568 transitions. [2022-11-02 21:01:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:42,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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 49 [2022-11-02 21:01:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:42,288 INFO L225 Difference]: With dead ends: 445 [2022-11-02 21:01:42,288 INFO L226 Difference]: Without dead ends: 429 [2022-11-02 21:01:42,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:01:42,289 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 53 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:42,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1760 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-11-02 21:01:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 417. [2022-11-02 21:01:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 371 states have (on average 1.2641509433962264) internal successors, (469), 375 states have internal predecessors, (469), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (38), 26 states have call predecessors, (38), 25 states have call successors, (38) [2022-11-02 21:01:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 536 transitions. [2022-11-02 21:01:42,298 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 536 transitions. Word has length 49 [2022-11-02 21:01:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:42,298 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 536 transitions. [2022-11-02 21:01:42,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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:01:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 536 transitions. [2022-11-02 21:01:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 21:01:42,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:42,301 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:01:42,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 21:01:42,301 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:42,302 INFO L85 PathProgramCache]: Analyzing trace with hash -48892372, now seen corresponding path program 1 times [2022-11-02 21:01:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:42,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480842044] [2022-11-02 21:01:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:42,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:42,471 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:01:42,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:42,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480842044] [2022-11-02 21:01:42,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480842044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:42,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:42,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:01:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886957929] [2022-11-02 21:01:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:42,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:42,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:42,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:42,475 INFO L87 Difference]: Start difference. First operand 417 states and 536 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:42,712 INFO L93 Difference]: Finished difference Result 561 states and 736 transitions. [2022-11-02 21:01:42,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:01:42,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-11-02 21:01:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:42,715 INFO L225 Difference]: With dead ends: 561 [2022-11-02 21:01:42,715 INFO L226 Difference]: Without dead ends: 561 [2022-11-02 21:01:42,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:42,717 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 104 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:42,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1794 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-11-02 21:01:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 417. [2022-11-02 21:01:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 371 states have (on average 1.261455525606469) internal successors, (468), 375 states have internal predecessors, (468), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (38), 26 states have call predecessors, (38), 25 states have call successors, (38) [2022-11-02 21:01:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 535 transitions. [2022-11-02 21:01:42,728 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 535 transitions. Word has length 51 [2022-11-02 21:01:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:42,728 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 535 transitions. [2022-11-02 21:01:42,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:01:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2022-11-02 21:01:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 21:01:42,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:42,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:42,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 21:01:42,730 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1190154103, now seen corresponding path program 1 times [2022-11-02 21:01:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:42,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979181472] [2022-11-02 21:01:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:42,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:42,870 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:01:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:42,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979181472] [2022-11-02 21:01:42,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979181472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:42,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:42,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222583992] [2022-11-02 21:01:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:42,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:42,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:42,873 INFO L87 Difference]: Start difference. First operand 417 states and 535 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 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:01:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:43,159 INFO L93 Difference]: Finished difference Result 441 states and 561 transitions. [2022-11-02 21:01:43,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:43,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 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 53 [2022-11-02 21:01:43,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:43,162 INFO L225 Difference]: With dead ends: 441 [2022-11-02 21:01:43,162 INFO L226 Difference]: Without dead ends: 407 [2022-11-02 21:01:43,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:01:43,163 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 61 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:43,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1764 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-02 21:01:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 395. [2022-11-02 21:01:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 352 states have (on average 1.2613636363636365) internal successors, (444), 356 states have internal predecessors, (444), 27 states have call successors, (27), 15 states have call predecessors, (27), 15 states have return successors, (36), 24 states have call predecessors, (36), 23 states have call successors, (36) [2022-11-02 21:01:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 507 transitions. [2022-11-02 21:01:43,172 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 507 transitions. Word has length 53 [2022-11-02 21:01:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:43,172 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 507 transitions. [2022-11-02 21:01:43,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 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:01:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 507 transitions. [2022-11-02 21:01:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 21:01:43,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:43,174 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, 1] [2022-11-02 21:01:43,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 21:01:43,174 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:43,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1140585270, now seen corresponding path program 1 times [2022-11-02 21:01:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:43,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201024563] [2022-11-02 21:01:43,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:01:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,284 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:01:43,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:43,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201024563] [2022-11-02 21:01:43,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201024563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:43,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:43,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:01:43,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794352578] [2022-11-02 21:01:43,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:43,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:43,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:43,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:43,286 INFO L87 Difference]: Start difference. First operand 395 states and 507 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:43,552 INFO L93 Difference]: Finished difference Result 382 states and 481 transitions. [2022-11-02 21:01:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:01:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2022-11-02 21:01:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:43,554 INFO L225 Difference]: With dead ends: 382 [2022-11-02 21:01:43,554 INFO L226 Difference]: Without dead ends: 382 [2022-11-02 21:01:43,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:43,555 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 132 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:43,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1169 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-02 21:01:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 362. [2022-11-02 21:01:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 324 states have (on average 1.2623456790123457) internal successors, (409), 327 states have internal predecessors, (409), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (24), 21 states have call predecessors, (24), 21 states have call successors, (24) [2022-11-02 21:01:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 457 transitions. [2022-11-02 21:01:43,563 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 457 transitions. Word has length 59 [2022-11-02 21:01:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:43,563 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 457 transitions. [2022-11-02 21:01:43,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 457 transitions. [2022-11-02 21:01:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 21:01:43,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:43,565 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, 1, 1, 1] [2022-11-02 21:01:43,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 21:01:43,565 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:43,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash 731705651, now seen corresponding path program 1 times [2022-11-02 21:01:43,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:43,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119335599] [2022-11-02 21:01:43,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:43,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:01:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:01:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,685 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:01:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:43,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119335599] [2022-11-02 21:01:43,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119335599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:43,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:43,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:43,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248916748] [2022-11-02 21:01:43,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:43,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:43,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:43,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:43,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:43,688 INFO L87 Difference]: Start difference. First operand 362 states and 457 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:44,169 INFO L93 Difference]: Finished difference Result 487 states and 595 transitions. [2022-11-02 21:01:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:01:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2022-11-02 21:01:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:44,171 INFO L225 Difference]: With dead ends: 487 [2022-11-02 21:01:44,171 INFO L226 Difference]: Without dead ends: 487 [2022-11-02 21:01:44,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:01:44,172 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 355 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:44,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1373 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:01:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-02 21:01:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 456. [2022-11-02 21:01:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 408 states have (on average 1.2475490196078431) internal successors, (509), 413 states have internal predecessors, (509), 26 states have call successors, (26), 20 states have call predecessors, (26), 21 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-02 21:01:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 562 transitions. [2022-11-02 21:01:44,186 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 562 transitions. Word has length 61 [2022-11-02 21:01:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:44,186 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 562 transitions. [2022-11-02 21:01:44,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 562 transitions. [2022-11-02 21:01:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:01:44,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:44,188 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, 1, 1, 1, 1] [2022-11-02 21:01:44,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 21:01:44,188 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1386771644, now seen corresponding path program 1 times [2022-11-02 21:01:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:44,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426199181] [2022-11-02 21:01:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:44,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:01:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:01:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:44,325 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:01:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:44,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426199181] [2022-11-02 21:01:44,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426199181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:44,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:44,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:01:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349368663] [2022-11-02 21:01:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:44,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:01:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:44,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:01:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:44,327 INFO L87 Difference]: Start difference. First operand 456 states and 562 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 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:01:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:44,672 INFO L93 Difference]: Finished difference Result 455 states and 560 transitions. [2022-11-02 21:01:44,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:44,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 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 62 [2022-11-02 21:01:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:44,674 INFO L225 Difference]: With dead ends: 455 [2022-11-02 21:01:44,674 INFO L226 Difference]: Without dead ends: 343 [2022-11-02 21:01:44,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:01:44,675 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 97 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:44,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1606 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:01:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-02 21:01:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-11-02 21:01:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 304 states have (on average 1.2532894736842106) internal successors, (381), 308 states have internal predecessors, (381), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 21:01:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 425 transitions. [2022-11-02 21:01:44,682 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 425 transitions. Word has length 62 [2022-11-02 21:01:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:44,682 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 425 transitions. [2022-11-02 21:01:44,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 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:01:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 425 transitions. [2022-11-02 21:01:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:01:44,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:44,684 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, 1, 1, 1, 1, 1] [2022-11-02 21:01:44,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 21:01:44,684 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash -643436666, now seen corresponding path program 1 times [2022-11-02 21:01:44,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:44,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096135237] [2022-11-02 21:01:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:44,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:01:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:44,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:44,863 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:01:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:44,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096135237] [2022-11-02 21:01:44,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096135237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:44,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:44,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:01:44,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705090861] [2022-11-02 21:01:44,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:44,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:01:44,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:44,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:01:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:44,866 INFO L87 Difference]: Start difference. First operand 343 states and 425 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:45,128 INFO L93 Difference]: Finished difference Result 375 states and 461 transitions. [2022-11-02 21:01:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 63 [2022-11-02 21:01:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:45,130 INFO L225 Difference]: With dead ends: 375 [2022-11-02 21:01:45,130 INFO L226 Difference]: Without dead ends: 359 [2022-11-02 21:01:45,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:01:45,131 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 246 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:45,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 990 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-02 21:01:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 351. [2022-11-02 21:01:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 311 states have (on average 1.247588424437299) internal successors, (388), 315 states have internal predecessors, (388), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 19 states have call successors, (25) [2022-11-02 21:01:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 434 transitions. [2022-11-02 21:01:45,139 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 434 transitions. Word has length 63 [2022-11-02 21:01:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:45,139 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 434 transitions. [2022-11-02 21:01:45,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 434 transitions. [2022-11-02 21:01:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:01:45,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:45,140 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, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:45,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 21:01:45,141 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash -164766848, now seen corresponding path program 1 times [2022-11-02 21:01:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:45,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749757848] [2022-11-02 21:01:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:01:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 21:01:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:45,317 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:01:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:45,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749757848] [2022-11-02 21:01:45,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749757848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:45,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:45,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:01:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48853721] [2022-11-02 21:01:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:45,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:01:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:45,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:01:45,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:45,320 INFO L87 Difference]: Start difference. First operand 351 states and 434 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:45,533 INFO L93 Difference]: Finished difference Result 375 states and 460 transitions. [2022-11-02 21:01:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:45,533 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2022-11-02 21:01:45,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:45,535 INFO L225 Difference]: With dead ends: 375 [2022-11-02 21:01:45,535 INFO L226 Difference]: Without dead ends: 359 [2022-11-02 21:01:45,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:01:45,539 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 71 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:45,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1259 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-02 21:01:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 343. [2022-11-02 21:01:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 304 states have (on average 1.25) internal successors, (380), 308 states have internal predecessors, (380), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 21:01:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 424 transitions. [2022-11-02 21:01:45,550 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 424 transitions. Word has length 64 [2022-11-02 21:01:45,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:45,550 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 424 transitions. [2022-11-02 21:01:45,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 424 transitions. [2022-11-02 21:01:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 21:01:45,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:45,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:45,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 21:01:45,553 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:45,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash 955115294, now seen corresponding path program 1 times [2022-11-02 21:01:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:45,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222594650] [2022-11-02 21:01:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 21:01:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:45,695 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:01:45,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:45,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222594650] [2022-11-02 21:01:45,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222594650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:45,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:45,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669720017] [2022-11-02 21:01:45,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:45,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:45,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:45,698 INFO L87 Difference]: Start difference. First operand 343 states and 424 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:45,921 INFO L93 Difference]: Finished difference Result 395 states and 488 transitions. [2022-11-02 21:01:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:01:45,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-11-02 21:01:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:45,923 INFO L225 Difference]: With dead ends: 395 [2022-11-02 21:01:45,923 INFO L226 Difference]: Without dead ends: 370 [2022-11-02 21:01:45,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:01:45,924 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 85 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:45,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1133 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-02 21:01:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 354. [2022-11-02 21:01:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 314 states have (on average 1.2261146496815287) internal successors, (385), 319 states have internal predecessors, (385), 22 states have call successors, (22), 16 states have call predecessors, (22), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-11-02 21:01:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 430 transitions. [2022-11-02 21:01:45,931 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 430 transitions. Word has length 68 [2022-11-02 21:01:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:45,931 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 430 transitions. [2022-11-02 21:01:45,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 430 transitions. [2022-11-02 21:01:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 21:01:45,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:45,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:45,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 21:01:45,935 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash 162641819, now seen corresponding path program 1 times [2022-11-02 21:01:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:45,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024270750] [2022-11-02 21:01:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:01:46,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:46,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024270750] [2022-11-02 21:01:46,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024270750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:46,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:46,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:01:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059862945] [2022-11-02 21:01:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:46,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:46,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:46,114 INFO L87 Difference]: Start difference. First operand 354 states and 430 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (4), 2 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:01:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:46,266 INFO L93 Difference]: Finished difference Result 389 states and 473 transitions. [2022-11-02 21:01:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:46,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (4), 2 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 71 [2022-11-02 21:01:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:46,268 INFO L225 Difference]: With dead ends: 389 [2022-11-02 21:01:46,269 INFO L226 Difference]: Without dead ends: 389 [2022-11-02 21:01:46,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:01:46,269 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 77 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:46,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1148 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-02 21:01:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 262. [2022-11-02 21:01:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 231 states have (on average 1.1818181818181819) internal successors, (273), 235 states have internal predecessors, (273), 16 states have call successors, (16), 12 states have call predecessors, (16), 14 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-02 21:01:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2022-11-02 21:01:46,278 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 71 [2022-11-02 21:01:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:46,278 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2022-11-02 21:01:46,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (4), 2 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:01:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2022-11-02 21:01:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 21:01:46,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:46,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:46,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 21:01:46,296 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1179991342, now seen corresponding path program 1 times [2022-11-02 21:01:46,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:46,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436920543] [2022-11-02 21:01:46,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:46,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:01:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 21:01:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 21:01:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,466 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:01:46,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:46,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436920543] [2022-11-02 21:01:46,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436920543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:46,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:46,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658918467] [2022-11-02 21:01:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:46,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:46,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:46,471 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 5 states have internal predecessors, (67), 2 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:01:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:46,672 INFO L93 Difference]: Finished difference Result 258 states and 301 transitions. [2022-11-02 21:01:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:01:46,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 5 states have internal predecessors, (67), 2 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 74 [2022-11-02 21:01:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:46,674 INFO L225 Difference]: With dead ends: 258 [2022-11-02 21:01:46,674 INFO L226 Difference]: Without dead ends: 256 [2022-11-02 21:01:46,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:01:46,675 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 46 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:46,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1043 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-02 21:01:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 208. [2022-11-02 21:01:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 184 states have (on average 1.1630434782608696) internal successors, (214), 187 states have internal predecessors, (214), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-02 21:01:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2022-11-02 21:01:46,680 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 74 [2022-11-02 21:01:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:46,681 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2022-11-02 21:01:46,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 5 states have internal predecessors, (67), 2 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:01:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2022-11-02 21:01:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 21:01:46,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:46,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:46,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 21:01:46,683 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:46,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 928752582, now seen corresponding path program 1 times [2022-11-02 21:01:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:46,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585576115] [2022-11-02 21:01:46,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:46,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 21:01:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 21:01:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:46,817 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:01:46,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:46,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585576115] [2022-11-02 21:01:46,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585576115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:46,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:46,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593130500] [2022-11-02 21:01:46,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:46,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:46,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:46,819 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:47,250 INFO L93 Difference]: Finished difference Result 399 states and 460 transitions. [2022-11-02 21:01:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:01:47,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2022-11-02 21:01:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:47,252 INFO L225 Difference]: With dead ends: 399 [2022-11-02 21:01:47,252 INFO L226 Difference]: Without dead ends: 359 [2022-11-02 21:01:47,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:01:47,253 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 370 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:47,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1362 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:01:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-02 21:01:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 188. [2022-11-02 21:01:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.1607142857142858) internal successors, (195), 170 states have internal predecessors, (195), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 21:01:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2022-11-02 21:01:47,258 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 74 [2022-11-02 21:01:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:47,258 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2022-11-02 21:01:47,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2022-11-02 21:01:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 21:01:47,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:47,260 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, 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:01:47,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 21:01:47,260 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:47,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:47,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1434511596, now seen corresponding path program 1 times [2022-11-02 21:01:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:47,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961295443] [2022-11-02 21:01:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 21:01:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,385 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:01:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:47,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961295443] [2022-11-02 21:01:47,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961295443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:47,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:47,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960702801] [2022-11-02 21:01:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:47,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:47,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:47,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:47,387 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:47,493 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2022-11-02 21:01:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:01:47,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 80 [2022-11-02 21:01:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:47,494 INFO L225 Difference]: With dead ends: 196 [2022-11-02 21:01:47,495 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 21:01:47,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:47,496 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 45 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:47,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 473 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 21:01:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2022-11-02 21:01:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.1547619047619047) internal successors, (194), 170 states have internal predecessors, (194), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 21:01:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2022-11-02 21:01:47,500 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 80 [2022-11-02 21:01:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:47,500 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2022-11-02 21:01:47,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:01:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2022-11-02 21:01:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 21:01:47,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:47,502 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:47,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 21:01:47,503 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:47,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1155457, now seen corresponding path program 1 times [2022-11-02 21:01:47,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:47,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992501678] [2022-11-02 21:01:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 21:01:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 21:01:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992501678] [2022-11-02 21:01:47,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992501678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:47,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:47,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674331270] [2022-11-02 21:01:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:47,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:47,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:47,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:47,642 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:47,751 INFO L93 Difference]: Finished difference Result 218 states and 247 transitions. [2022-11-02 21:01:47,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:01:47,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 100 [2022-11-02 21:01:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:47,752 INFO L225 Difference]: With dead ends: 218 [2022-11-02 21:01:47,752 INFO L226 Difference]: Without dead ends: 218 [2022-11-02 21:01:47,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:47,753 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 47 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:47,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 643 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-02 21:01:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2022-11-02 21:01:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.1529411764705881) internal successors, (196), 172 states have internal predecessors, (196), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 21:01:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2022-11-02 21:01:47,758 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 100 [2022-11-02 21:01:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:47,759 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2022-11-02 21:01:47,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2022-11-02 21:01:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 21:01:47,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:47,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:47,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 21:01:47,761 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:47,762 INFO L85 PathProgramCache]: Analyzing trace with hash 877885761, now seen corresponding path program 1 times [2022-11-02 21:01:47,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:47,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042841878] [2022-11-02 21:01:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:47,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 21:01:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 21:01:47,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:47,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042841878] [2022-11-02 21:01:47,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042841878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:47,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:47,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:01:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574243470] [2022-11-02 21:01:47,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:47,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:01:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:47,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:01:47,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:47,969 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:48,219 INFO L93 Difference]: Finished difference Result 227 states and 258 transitions. [2022-11-02 21:01:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:48,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 100 [2022-11-02 21:01:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:48,221 INFO L225 Difference]: With dead ends: 227 [2022-11-02 21:01:48,221 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 21:01:48,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:01:48,222 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 280 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:48,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 848 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 21:01:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2022-11-02 21:01:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.1428571428571428) internal successors, (192), 170 states have internal predecessors, (192), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 21:01:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2022-11-02 21:01:48,226 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 100 [2022-11-02 21:01:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:48,227 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2022-11-02 21:01:48,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2022-11-02 21:01:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:01:48,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:48,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:48,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 21:01:48,229 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:48,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1148812128, now seen corresponding path program 1 times [2022-11-02 21:01:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:48,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672624677] [2022-11-02 21:01:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:48,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:48,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:01:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:01:48,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:48,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672624677] [2022-11-02 21:01:48,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672624677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:48,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:48,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 21:01:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277121118] [2022-11-02 21:01:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:48,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:01:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:48,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:01:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:01:48,537 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:49,003 INFO L93 Difference]: Finished difference Result 293 states and 337 transitions. [2022-11-02 21:01:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:01:49,004 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 101 [2022-11-02 21:01:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:49,005 INFO L225 Difference]: With dead ends: 293 [2022-11-02 21:01:49,005 INFO L226 Difference]: Without dead ends: 262 [2022-11-02 21:01:49,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-11-02 21:01:49,006 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 473 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:49,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1238 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:01:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-02 21:01:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 203. [2022-11-02 21:01:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.1483516483516483) internal successors, (209), 184 states have internal predecessors, (209), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-02 21:01:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 229 transitions. [2022-11-02 21:01:49,011 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 229 transitions. Word has length 101 [2022-11-02 21:01:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:49,013 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 229 transitions. [2022-11-02 21:01:49,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 229 transitions. [2022-11-02 21:01:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-02 21:01:49,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:49,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:49,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 21:01:49,015 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash 312231464, now seen corresponding path program 1 times [2022-11-02 21:01:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:49,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371309957] [2022-11-02 21:01:49,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:49,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 21:01:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:49,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371309957] [2022-11-02 21:01:49,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371309957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:49,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:49,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 21:01:49,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381984688] [2022-11-02 21:01:49,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:49,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:01:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:49,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:01:49,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:01:49,375 INFO L87 Difference]: Start difference. First operand 203 states and 229 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:49,691 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2022-11-02 21:01:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:49,692 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 102 [2022-11-02 21:01:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:49,693 INFO L225 Difference]: With dead ends: 220 [2022-11-02 21:01:49,693 INFO L226 Difference]: Without dead ends: 217 [2022-11-02 21:01:49,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:01:49,694 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 30 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:49,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1568 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:01:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-02 21:01:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2022-11-02 21:01:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.1428571428571428) internal successors, (208), 184 states have internal predecessors, (208), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2022-11-02 21:01:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 228 transitions. [2022-11-02 21:01:49,698 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 228 transitions. Word has length 102 [2022-11-02 21:01:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:49,699 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 228 transitions. [2022-11-02 21:01:49,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 228 transitions. [2022-11-02 21:01:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 21:01:49,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:49,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:49,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 21:01:49,700 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -231607862, now seen corresponding path program 1 times [2022-11-02 21:01:49,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:49,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270901172] [2022-11-02 21:01:49,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:49,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:49,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:01:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 21:01:49,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:49,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270901172] [2022-11-02 21:01:49,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270901172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:49,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:49,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:49,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149324497] [2022-11-02 21:01:49,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:49,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:49,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:49,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:49,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:49,840 INFO L87 Difference]: Start difference. First operand 203 states and 228 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:49,938 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2022-11-02 21:01:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:01:49,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 105 [2022-11-02 21:01:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:49,939 INFO L225 Difference]: With dead ends: 204 [2022-11-02 21:01:49,940 INFO L226 Difference]: Without dead ends: 195 [2022-11-02 21:01:49,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:01:49,942 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 175 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:49,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 277 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-02 21:01:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2022-11-02 21:01:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.124223602484472) internal successors, (181), 163 states have internal predecessors, (181), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-02 21:01:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 200 transitions. [2022-11-02 21:01:49,946 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 200 transitions. Word has length 105 [2022-11-02 21:01:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:49,946 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 200 transitions. [2022-11-02 21:01:49,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 21:01:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 200 transitions. [2022-11-02 21:01:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 21:01:49,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:49,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:49,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 21:01:49,948 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:49,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:49,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1876893126, now seen corresponding path program 1 times [2022-11-02 21:01:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:49,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067533746] [2022-11-02 21:01:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 21:01:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:01:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:50,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067533746] [2022-11-02 21:01:50,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067533746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:50,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:50,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:50,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99979865] [2022-11-02 21:01:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:50,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:50,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:50,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:50,182 INFO L87 Difference]: Start difference. First operand 181 states and 200 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 21:01:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:50,322 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2022-11-02 21:01:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:01:50,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 111 [2022-11-02 21:01:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:50,324 INFO L225 Difference]: With dead ends: 170 [2022-11-02 21:01:50,324 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 21:01:50,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:01:50,324 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 66 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:50,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 614 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 21:01:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-02 21:01:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.1118881118881119) internal successors, (159), 144 states have internal predecessors, (159), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-02 21:01:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2022-11-02 21:01:50,328 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 111 [2022-11-02 21:01:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:50,329 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2022-11-02 21:01:50,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 21:01:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2022-11-02 21:01:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 21:01:50,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:50,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:50,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 21:01:50,331 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1629424061, now seen corresponding path program 1 times [2022-11-02 21:01:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:50,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125322448] [2022-11-02 21:01:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:01:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 21:01:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:01:50,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125322448] [2022-11-02 21:01:50,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125322448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:50,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:50,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811774942] [2022-11-02 21:01:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:50,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:50,532 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 21:01:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:50,806 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2022-11-02 21:01:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:01:50,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 112 [2022-11-02 21:01:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:50,807 INFO L225 Difference]: With dead ends: 278 [2022-11-02 21:01:50,807 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 21:01:50,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:01:50,808 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 136 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:50,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 744 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 21:01:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-02 21:01:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 144 states have internal predecessors, (158), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-11-02 21:01:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2022-11-02 21:01:50,811 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 112 [2022-11-02 21:01:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:50,812 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2022-11-02 21:01:50,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 21:01:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2022-11-02 21:01:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 21:01:50,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:50,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:50,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 21:01:50,813 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 21:01:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:50,814 INFO L85 PathProgramCache]: Analyzing trace with hash 692377857, now seen corresponding path program 1 times [2022-11-02 21:01:50,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:50,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492389506] [2022-11-02 21:01:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:50,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:01:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:01:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 21:01:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 21:01:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:51,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492389506] [2022-11-02 21:01:51,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492389506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:51,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:51,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 21:01:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424721575] [2022-11-02 21:01:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:51,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:01:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:51,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:01:51,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:01:51,095 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 21:01:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:51,480 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2022-11-02 21:01:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:01:51,481 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 112 [2022-11-02 21:01:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:51,481 INFO L225 Difference]: With dead ends: 170 [2022-11-02 21:01:51,481 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 21:01:51,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2022-11-02 21:01:51,482 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 401 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:51,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 604 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:01:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 21:01:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 21:01:51,483 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:01:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 21:01:51,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2022-11-02 21:01:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:51,483 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:01:51,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 21:01:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 21:01:51,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 21:01:51,486 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-11-02 21:01:51,486 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-11-02 21:01:51,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 21:01:51,490 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, 1, 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:01:51,492 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:01:51,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:01:51 BoogieIcfgContainer [2022-11-02 21:01:51,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:01:51,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:01:51,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:01:51,495 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:01:51,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:01:31" (3/4) ... [2022-11-02 21:01:51,499 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 21:01:51,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2022-11-02 21:01:51,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2022-11-02 21:01:51,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-11-02 21:01:51,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-02 21:01:51,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-02 21:01:51,519 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2022-11-02 21:01:51,521 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-02 21:01:51,522 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-02 21:01:51,524 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-02 21:01:51,658 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:01:51,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:01:51,659 INFO L158 Benchmark]: Toolchain (without parser) took 21477.34ms. Allocated memory was 96.5MB in the beginning and 283.1MB in the end (delta: 186.6MB). Free memory was 56.2MB in the beginning and 115.3MB in the end (delta: -59.1MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. [2022-11-02 21:01:51,659 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 96.5MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:01:51,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.62ms. Allocated memory is still 96.5MB. Free memory was 56.0MB in the beginning and 62.1MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 21:01:51,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.83ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 57.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:01:51,660 INFO L158 Benchmark]: Boogie Preprocessor took 47.51ms. Allocated memory is still 96.5MB. Free memory was 57.1MB in the beginning and 54.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:01:51,660 INFO L158 Benchmark]: RCFGBuilder took 1126.89ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 53.7MB in the beginning and 58.6MB in the end (delta: -4.8MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2022-11-02 21:01:51,661 INFO L158 Benchmark]: TraceAbstraction took 19577.17ms. Allocated memory was 117.4MB in the beginning and 283.1MB in the end (delta: 165.7MB). Free memory was 57.8MB in the beginning and 128.9MB in the end (delta: -71.1MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2022-11-02 21:01:51,661 INFO L158 Benchmark]: Witness Printer took 163.45ms. Allocated memory is still 283.1MB. Free memory was 128.9MB in the beginning and 115.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 21:01:51,672 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.28ms. Allocated memory is still 96.5MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.62ms. Allocated memory is still 96.5MB. Free memory was 56.0MB in the beginning and 62.1MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.83ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 57.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.51ms. Allocated memory is still 96.5MB. Free memory was 57.1MB in the beginning and 54.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1126.89ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 53.7MB in the beginning and 58.6MB in the end (delta: -4.8MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19577.17ms. Allocated memory was 117.4MB in the beginning and 283.1MB in the end (delta: 165.7MB). Free memory was 57.8MB in the beginning and 128.9MB in the end (delta: -71.1MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. * Witness Printer took 163.45ms. Allocated memory is still 283.1MB. Free memory was 128.9MB in the beginning and 115.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. 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: 65]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 670]: 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 6 procedures, 238 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 48, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8824 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8690 mSDsluCounter, 48758 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36323 mSDsCounter, 1342 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10770 IncrementalHoareTripleChecker+Invalid, 12112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1342 mSolverCounterUnsat, 12435 mSDtfsCounter, 10770 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 587 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=643occurred in iteration=13, InterpolantAutomatonStates: 361, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 48 MinimizatonAttempts, 1430 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2599 NumberOfCodeBlocks, 2599 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2551 ConstructedInterpolants, 0 QuantifiedInterpolants, 5869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 140/140 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:01:51,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfa1e6d-f12b-40de-9022-3e753599afd0/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