./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.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_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/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_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/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_660504ba-41c1-4b1f-a938-875d8cabcadd/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 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe --- 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 19:50:01,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:50:01,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:50:01,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:50:01,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:50:01,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:50:01,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:50:01,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:50:01,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:50:01,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:50:01,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:50:01,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:50:01,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:50:01,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:50:01,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:50:01,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:50:01,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:50:01,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:50:01,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:50:01,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:50:01,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:50:01,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:50:01,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:50:01,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:50:01,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:50:01,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:50:01,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:50:01,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:50:01,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:50:01,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:50:01,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:50:01,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:50:01,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:50:01,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:50:01,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:50:01,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:50:01,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:50:01,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:50:01,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:50:01,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:50:01,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:50:01,684 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 19:50:01,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:50:01,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:50:01,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:50:01,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:50:01,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:50:01,722 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:50:01,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:50:01,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:50:01,723 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:50:01,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:50:01,724 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 19:50:01,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 19:50:01,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:50:01,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 19:50:01,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:50:01,726 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 19:50:01,726 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 19:50:01,726 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 19:50:01,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:50:01,727 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 19:50:01,727 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 19:50:01,727 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:50:01,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:50:01,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:50:01,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:50:01,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:50:01,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:50:01,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:50:01,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 19:50:01,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 19:50:01,730 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_660504ba-41c1-4b1f-a938-875d8cabcadd/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_660504ba-41c1-4b1f-a938-875d8cabcadd/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 -> 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe [2022-11-02 19:50:02,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:50:02,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:50:02,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:50:02,047 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:50:02,048 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:50:02,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-11-02 19:50:02,122 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/data/c6a5fab8f/8354b732c3e24215aa06523994dd4c43/FLAGcc72ab988 [2022-11-02 19:50:02,777 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:50:02,778 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-11-02 19:50:02,798 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/data/c6a5fab8f/8354b732c3e24215aa06523994dd4c43/FLAGcc72ab988 [2022-11-02 19:50:03,016 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/data/c6a5fab8f/8354b732c3e24215aa06523994dd4c43 [2022-11-02 19:50:03,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:50:03,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:50:03,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:50:03,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:50:03,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:50:03,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:03,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e24c993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03, skipping insertion in model container [2022-11-02 19:50:03,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:03,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:50:03,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:50:03,380 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_660504ba-41c1-4b1f-a938-875d8cabcadd/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c[2073,2086] [2022-11-02 19:50:03,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:50:03,614 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:50:03,642 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_660504ba-41c1-4b1f-a938-875d8cabcadd/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c[2073,2086] [2022-11-02 19:50:03,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:50:03,800 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:50:03,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03 WrapperNode [2022-11-02 19:50:03,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:50:03,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:50:03,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:50:03,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:50:03,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:03,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:03,961 INFO L138 Inliner]: procedures = 41, calls = 107, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1581 [2022-11-02 19:50:03,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:50:03,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:50:03,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:50:03,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:50:03,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:03,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:03,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:03,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:04,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:04,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:04,037 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:04,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:04,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:50:04,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:50:04,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:50:04,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:50:04,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (1/1) ... [2022-11-02 19:50:04,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:50:04,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:50:04,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:50:04,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:50:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-11-02 19:50:04,203 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-11-02 19:50:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:50:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-11-02 19:50:04,204 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-11-02 19:50:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-02 19:50:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-02 19:50:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-11-02 19:50:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-11-02 19:50:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-02 19:50:04,205 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-02 19:50:04,206 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-02 19:50:04,207 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-02 19:50:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-11-02 19:50:04,207 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-11-02 19:50:04,207 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-11-02 19:50:04,208 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-11-02 19:50:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-11-02 19:50:04,208 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-11-02 19:50:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 19:50:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 19:50:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 19:50:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 19:50:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 19:50:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-11-02 19:50:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-11-02 19:50:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:50:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:50:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-11-02 19:50:04,211 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-11-02 19:50:04,570 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:50:04,572 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:50:04,687 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 19:50:04,735 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-11-02 19:50:04,736 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-11-02 19:50:04,859 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 19:50:04,899 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-02 19:50:04,899 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-02 19:50:04,918 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 19:50:04,919 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 19:50:04,922 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 19:50:04,940 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 19:50:04,952 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 19:50:04,968 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 19:50:04,971 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 19:50:05,616 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-11-02 19:50:05,617 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-11-02 19:50:05,617 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-11-02 19:50:05,617 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-11-02 19:50:05,617 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-11-02 19:50:05,617 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-11-02 19:50:05,618 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-11-02 19:50:05,618 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-11-02 19:50:05,618 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-11-02 19:50:05,618 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-11-02 19:50:05,618 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-11-02 19:50:05,619 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-02 19:50:05,619 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-02 19:50:05,620 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-11-02 19:50:05,620 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-11-02 19:50:05,689 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:50:05,706 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:50:05,710 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 19:50:05,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:50:05 BoogieIcfgContainer [2022-11-02 19:50:05,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:50:05,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:50:05,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:50:05,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:50:05,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:50:03" (1/3) ... [2022-11-02 19:50:05,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430300f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:50:05, skipping insertion in model container [2022-11-02 19:50:05,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:50:03" (2/3) ... [2022-11-02 19:50:05,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430300f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:50:05, skipping insertion in model container [2022-11-02 19:50:05,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:50:05" (3/3) ... [2022-11-02 19:50:05,724 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2022-11-02 19:50:05,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:50:05,746 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 19:50:05,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:50:05,837 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;@58ebef19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:50:05,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 19:50:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 469 states, 367 states have (on average 1.5095367847411445) internal successors, (554), 386 states have internal predecessors, (554), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 19:50:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 19:50:05,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:05,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:05,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2107937654, now seen corresponding path program 1 times [2022-11-02 19:50:05,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:05,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068772820] [2022-11-02 19:50:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:06,095 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 19:50:06,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:06,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068772820] [2022-11-02 19:50:06,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068772820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:06,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:06,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:50:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764851984] [2022-11-02 19:50:06,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:06,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:50:06,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:06,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:50:06,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:06,136 INFO L87 Difference]: Start difference. First operand has 469 states, 367 states have (on average 1.5095367847411445) internal successors, (554), 386 states have internal predecessors, (554), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) 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 19:50:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:06,308 INFO L93 Difference]: Finished difference Result 621 states and 922 transitions. [2022-11-02 19:50:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:50:06,311 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 19:50:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:06,333 INFO L225 Difference]: With dead ends: 621 [2022-11-02 19:50:06,333 INFO L226 Difference]: Without dead ends: 617 [2022-11-02 19:50:06,335 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 19:50:06,338 INFO L413 NwaCegarLoop]: 727 mSDtfsCounter, 690 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:06,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 946 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:50:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-02 19:50:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 601. [2022-11-02 19:50:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 485 states have (on average 1.4721649484536083) internal successors, (714), 492 states have internal predecessors, (714), 93 states have call successors, (93), 18 states have call predecessors, (93), 21 states have return successors, (94), 94 states have call predecessors, (94), 79 states have call successors, (94) [2022-11-02 19:50:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 901 transitions. [2022-11-02 19:50:06,422 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 901 transitions. Word has length 8 [2022-11-02 19:50:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:06,423 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 901 transitions. [2022-11-02 19:50:06,423 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 19:50:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 901 transitions. [2022-11-02 19:50:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 19:50:06,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:06,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:06,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 19:50:06,425 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:06,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:06,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1313128949, now seen corresponding path program 1 times [2022-11-02 19:50:06,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:06,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911395070] [2022-11-02 19:50:06,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:06,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:06,507 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 19:50:06,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:06,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911395070] [2022-11-02 19:50:06,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911395070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:06,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:06,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:50:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390833013] [2022-11-02 19:50:06,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:06,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:50:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:06,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:50:06,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:06,512 INFO L87 Difference]: Start difference. First operand 601 states and 901 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:06,578 INFO L93 Difference]: Finished difference Result 603 states and 901 transitions. [2022-11-02 19:50:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:50:06,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 19:50:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:06,589 INFO L225 Difference]: With dead ends: 603 [2022-11-02 19:50:06,589 INFO L226 Difference]: Without dead ends: 603 [2022-11-02 19:50:06,590 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 19:50:06,594 INFO L413 NwaCegarLoop]: 701 mSDtfsCounter, 384 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:06,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 942 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:50:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-11-02 19:50:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-11-02 19:50:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 485 states have (on average 1.4701030927835053) internal successors, (713), 492 states have internal predecessors, (713), 93 states have call successors, (93), 18 states have call predecessors, (93), 21 states have return successors, (94), 94 states have call predecessors, (94), 79 states have call successors, (94) [2022-11-02 19:50:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 900 transitions. [2022-11-02 19:50:06,665 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 900 transitions. Word has length 9 [2022-11-02 19:50:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:06,666 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 900 transitions. [2022-11-02 19:50:06,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 900 transitions. [2022-11-02 19:50:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 19:50:06,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:06,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:06,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 19:50:06,667 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash 929451779, now seen corresponding path program 1 times [2022-11-02 19:50:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:06,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577443500] [2022-11-02 19:50:06,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:50:06,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:06,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577443500] [2022-11-02 19:50:06,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577443500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:06,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:06,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:50:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642839965] [2022-11-02 19:50:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:06,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:50:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:06,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:50:06,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:06,782 INFO L87 Difference]: Start difference. First operand 601 states and 900 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:06,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:06,960 INFO L93 Difference]: Finished difference Result 600 states and 899 transitions. [2022-11-02 19:50:06,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:50:06,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 19:50:06,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:06,963 INFO L225 Difference]: With dead ends: 600 [2022-11-02 19:50:06,963 INFO L226 Difference]: Without dead ends: 597 [2022-11-02 19:50:06,964 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 19:50:06,965 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 416 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:06,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 847 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:50:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-02 19:50:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 591. [2022-11-02 19:50:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 476 states have (on average 1.4516806722689075) internal successors, (691), 482 states have internal predecessors, (691), 93 states have call successors, (93), 18 states have call predecessors, (93), 21 states have return successors, (94), 94 states have call predecessors, (94), 79 states have call successors, (94) [2022-11-02 19:50:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 878 transitions. [2022-11-02 19:50:07,015 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 878 transitions. Word has length 9 [2022-11-02 19:50:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:07,016 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 878 transitions. [2022-11-02 19:50:07,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 878 transitions. [2022-11-02 19:50:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 19:50:07,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:07,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:07,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 19:50:07,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1469618303, now seen corresponding path program 1 times [2022-11-02 19:50:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:07,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111370759] [2022-11-02 19:50:07,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:07,115 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 19:50:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:07,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111370759] [2022-11-02 19:50:07,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111370759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:07,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:07,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:50:07,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116936196] [2022-11-02 19:50:07,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:07,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:50:07,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:07,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:50:07,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:07,118 INFO L87 Difference]: Start difference. First operand 591 states and 878 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 19:50:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:07,191 INFO L93 Difference]: Finished difference Result 594 states and 880 transitions. [2022-11-02 19:50:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:50:07,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2022-11-02 19:50:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:07,195 INFO L225 Difference]: With dead ends: 594 [2022-11-02 19:50:07,195 INFO L226 Difference]: Without dead ends: 591 [2022-11-02 19:50:07,195 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 19:50:07,197 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 0 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:07,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1329 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:50:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-11-02 19:50:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2022-11-02 19:50:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 476 states have (on average 1.449579831932773) internal successors, (690), 482 states have internal predecessors, (690), 93 states have call successors, (93), 18 states have call predecessors, (93), 21 states have return successors, (94), 94 states have call predecessors, (94), 79 states have call successors, (94) [2022-11-02 19:50:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 877 transitions. [2022-11-02 19:50:07,221 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 877 transitions. Word has length 13 [2022-11-02 19:50:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:07,221 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 877 transitions. [2022-11-02 19:50:07,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 19:50:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 877 transitions. [2022-11-02 19:50:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 19:50:07,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:07,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:07,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 19:50:07,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:07,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1712839995, now seen corresponding path program 1 times [2022-11-02 19:50:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:07,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973175701] [2022-11-02 19:50:07,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:07,269 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 19:50:07,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:07,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973175701] [2022-11-02 19:50:07,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973175701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:07,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:07,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:50:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850305165] [2022-11-02 19:50:07,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:07,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:50:07,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:07,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:50:07,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:07,272 INFO L87 Difference]: Start difference. First operand 591 states and 877 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 19:50:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:07,433 INFO L93 Difference]: Finished difference Result 835 states and 1220 transitions. [2022-11-02 19:50:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:50:07,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2022-11-02 19:50:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:07,439 INFO L225 Difference]: With dead ends: 835 [2022-11-02 19:50:07,440 INFO L226 Difference]: Without dead ends: 834 [2022-11-02 19:50:07,440 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 19:50:07,441 INFO L413 NwaCegarLoop]: 805 mSDtfsCounter, 564 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:07,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1027 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:50:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-11-02 19:50:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 791. [2022-11-02 19:50:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 649 states have (on average 1.4206471494607087) internal successors, (922), 641 states have internal predecessors, (922), 106 states have call successors, (106), 31 states have call predecessors, (106), 35 states have return successors, (136), 122 states have call predecessors, (136), 96 states have call successors, (136) [2022-11-02 19:50:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1164 transitions. [2022-11-02 19:50:07,473 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1164 transitions. Word has length 15 [2022-11-02 19:50:07,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:07,473 INFO L495 AbstractCegarLoop]: Abstraction has 791 states and 1164 transitions. [2022-11-02 19:50:07,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 19:50:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1164 transitions. [2022-11-02 19:50:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 19:50:07,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:07,475 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 19:50:07,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 19:50:07,475 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1752786185, now seen corresponding path program 1 times [2022-11-02 19:50:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:07,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322944350] [2022-11-02 19:50:07,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:07,636 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 19:50:07,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:07,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322944350] [2022-11-02 19:50:07,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322944350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:07,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:07,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:50:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511343306] [2022-11-02 19:50:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:07,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:50:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:07,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:50:07,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:07,639 INFO L87 Difference]: Start difference. First operand 791 states and 1164 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19:50:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:07,685 INFO L93 Difference]: Finished difference Result 867 states and 1260 transitions. [2022-11-02 19:50:07,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:50:07,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-11-02 19:50:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:07,692 INFO L225 Difference]: With dead ends: 867 [2022-11-02 19:50:07,692 INFO L226 Difference]: Without dead ends: 867 [2022-11-02 19:50:07,693 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 19:50:07,697 INFO L413 NwaCegarLoop]: 664 mSDtfsCounter, 601 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:07,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 849 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:50:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-11-02 19:50:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 839. [2022-11-02 19:50:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 692 states have (on average 1.439306358381503) internal successors, (996), 695 states have internal predecessors, (996), 105 states have call successors, (105), 35 states have call predecessors, (105), 41 states have return successors, (127), 108 states have call predecessors, (127), 98 states have call successors, (127) [2022-11-02 19:50:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1228 transitions. [2022-11-02 19:50:07,750 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1228 transitions. Word has length 19 [2022-11-02 19:50:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:07,751 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 1228 transitions. [2022-11-02 19:50:07,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19:50:07,751 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1228 transitions. [2022-11-02 19:50:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 19:50:07,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:07,758 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] [2022-11-02 19:50:07,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 19:50:07,758 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:07,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1868596178, now seen corresponding path program 1 times [2022-11-02 19:50:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:07,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673461261] [2022-11-02 19:50:07,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:07,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:07,833 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 19:50:07,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:07,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673461261] [2022-11-02 19:50:07,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673461261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:07,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:07,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:50:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319779131] [2022-11-02 19:50:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:07,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:50:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:50:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:07,837 INFO L87 Difference]: Start difference. First operand 839 states and 1228 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19:50:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:07,996 INFO L93 Difference]: Finished difference Result 1332 states and 2008 transitions. [2022-11-02 19:50:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:50:07,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2022-11-02 19:50:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:08,005 INFO L225 Difference]: With dead ends: 1332 [2022-11-02 19:50:08,006 INFO L226 Difference]: Without dead ends: 1332 [2022-11-02 19:50:08,008 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 19:50:08,011 INFO L413 NwaCegarLoop]: 1002 mSDtfsCounter, 336 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:08,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1616 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:50:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-11-02 19:50:08,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1027. [2022-11-02 19:50:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 848 states have (on average 1.4375) internal successors, (1219), 849 states have internal predecessors, (1219), 122 states have call successors, (122), 47 states have call predecessors, (122), 56 states have return successors, (205), 130 states have call predecessors, (205), 115 states have call successors, (205) [2022-11-02 19:50:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1546 transitions. [2022-11-02 19:50:08,060 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1546 transitions. Word has length 21 [2022-11-02 19:50:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:08,065 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1546 transitions. [2022-11-02 19:50:08,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19:50:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1546 transitions. [2022-11-02 19:50:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 19:50:08,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:08,069 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 19:50:08,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 19:50:08,069 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:08,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1853359414, now seen corresponding path program 1 times [2022-11-02 19:50:08,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:08,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944842628] [2022-11-02 19:50:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:08,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:08,244 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 19:50:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:08,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944842628] [2022-11-02 19:50:08,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944842628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:08,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:08,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:50:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213222171] [2022-11-02 19:50:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:08,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:50:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:08,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:50:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:50:08,246 INFO L87 Difference]: Start difference. First operand 1027 states and 1546 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 19:50:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:08,677 INFO L93 Difference]: Finished difference Result 1060 states and 1579 transitions. [2022-11-02 19:50:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:50:08,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 22 [2022-11-02 19:50:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:08,683 INFO L225 Difference]: With dead ends: 1060 [2022-11-02 19:50:08,683 INFO L226 Difference]: Without dead ends: 1060 [2022-11-02 19:50:08,683 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 19:50:08,684 INFO L413 NwaCegarLoop]: 711 mSDtfsCounter, 1029 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:08,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 863 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2022-11-02 19:50:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1009. [2022-11-02 19:50:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 833 states have (on average 1.4309723889555823) internal successors, (1192), 834 states have internal predecessors, (1192), 119 states have call successors, (119), 44 states have call predecessors, (119), 56 states have return successors, (199), 130 states have call predecessors, (199), 112 states have call successors, (199) [2022-11-02 19:50:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1510 transitions. [2022-11-02 19:50:08,718 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1510 transitions. Word has length 22 [2022-11-02 19:50:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:08,718 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1510 transitions. [2022-11-02 19:50:08,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 19:50:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1510 transitions. [2022-11-02 19:50:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 19:50:08,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:08,720 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] [2022-11-02 19:50:08,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 19:50:08,720 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -401986613, now seen corresponding path program 1 times [2022-11-02 19:50:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:08,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003808021] [2022-11-02 19:50:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:08,762 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 19:50:08,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:08,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003808021] [2022-11-02 19:50:08,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003808021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:08,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:08,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:50:08,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369490750] [2022-11-02 19:50:08,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:08,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:50:08,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:08,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:50:08,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:08,764 INFO L87 Difference]: Start difference. First operand 1009 states and 1510 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 19:50:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:08,828 INFO L93 Difference]: Finished difference Result 1008 states and 1507 transitions. [2022-11-02 19:50:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:50:08,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2022-11-02 19:50:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:08,833 INFO L225 Difference]: With dead ends: 1008 [2022-11-02 19:50:08,833 INFO L226 Difference]: Without dead ends: 1008 [2022-11-02 19:50:08,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:08,836 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 22 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:08,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1248 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:50:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-11-02 19:50:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2022-11-02 19:50:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 833 states have (on average 1.4285714285714286) internal successors, (1190), 833 states have internal predecessors, (1190), 118 states have call successors, (118), 44 states have call predecessors, (118), 56 states have return successors, (199), 130 states have call predecessors, (199), 112 states have call successors, (199) [2022-11-02 19:50:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1507 transitions. [2022-11-02 19:50:08,874 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1507 transitions. Word has length 23 [2022-11-02 19:50:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:08,874 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1507 transitions. [2022-11-02 19:50:08,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 19:50:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1507 transitions. [2022-11-02 19:50:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 19:50:08,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:08,877 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] [2022-11-02 19:50:08,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 19:50:08,877 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash -411805955, now seen corresponding path program 1 times [2022-11-02 19:50:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:08,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330271539] [2022-11-02 19:50:08,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:08,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 19:50:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:08,941 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 19:50:08,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:08,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330271539] [2022-11-02 19:50:08,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330271539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:08,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:08,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:50:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416265509] [2022-11-02 19:50:08,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:08,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:50:08,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:08,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:50:08,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:50:08,945 INFO L87 Difference]: Start difference. First operand 1008 states and 1507 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (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 19:50:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:09,263 INFO L93 Difference]: Finished difference Result 1305 states and 1930 transitions. [2022-11-02 19:50:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:50:09,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (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 36 [2022-11-02 19:50:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:09,273 INFO L225 Difference]: With dead ends: 1305 [2022-11-02 19:50:09,273 INFO L226 Difference]: Without dead ends: 1305 [2022-11-02 19:50:09,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:50:09,274 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 768 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:09,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1360 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:50:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2022-11-02 19:50:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1065. [2022-11-02 19:50:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 881 states have (on average 1.41316685584563) internal successors, (1245), 886 states have internal predecessors, (1245), 115 states have call successors, (115), 49 states have call predecessors, (115), 68 states have return successors, (178), 129 states have call predecessors, (178), 109 states have call successors, (178) [2022-11-02 19:50:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1538 transitions. [2022-11-02 19:50:09,336 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1538 transitions. Word has length 36 [2022-11-02 19:50:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:09,338 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1538 transitions. [2022-11-02 19:50:09,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (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 19:50:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1538 transitions. [2022-11-02 19:50:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 19:50:09,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:09,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:09,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 19:50:09,346 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2014058946, now seen corresponding path program 1 times [2022-11-02 19:50:09,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:09,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629959864] [2022-11-02 19:50:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:09,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 19:50:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:09,412 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 19:50:09,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:09,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629959864] [2022-11-02 19:50:09,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629959864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:09,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:09,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:50:09,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022600414] [2022-11-02 19:50:09,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:09,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:50:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:09,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:50:09,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:50:09,414 INFO L87 Difference]: Start difference. First operand 1065 states and 1538 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 19:50:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:09,739 INFO L93 Difference]: Finished difference Result 836 states and 1213 transitions. [2022-11-02 19:50:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:50:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-02 19:50:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:09,744 INFO L225 Difference]: With dead ends: 836 [2022-11-02 19:50:09,744 INFO L226 Difference]: Without dead ends: 836 [2022-11-02 19:50:09,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:50:09,745 INFO L413 NwaCegarLoop]: 723 mSDtfsCounter, 248 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:09,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1763 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:50:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-11-02 19:50:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 797. [2022-11-02 19:50:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 659 states have (on average 1.4142640364188164) internal successors, (932), 666 states have internal predecessors, (932), 93 states have call successors, (93), 33 states have call predecessors, (93), 44 states have return successors, (121), 97 states have call predecessors, (121), 87 states have call successors, (121) [2022-11-02 19:50:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1146 transitions. [2022-11-02 19:50:09,775 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1146 transitions. Word has length 35 [2022-11-02 19:50:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:09,775 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1146 transitions. [2022-11-02 19:50:09,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 19:50:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1146 transitions. [2022-11-02 19:50:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 19:50:09,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:09,778 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 19:50:09,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 19:50:09,779 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1008894196, now seen corresponding path program 1 times [2022-11-02 19:50:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:09,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418772189] [2022-11-02 19:50:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:09,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 19:50:09,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:09,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418772189] [2022-11-02 19:50:09,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418772189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:09,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:09,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:50:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752399358] [2022-11-02 19:50:09,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:09,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:50:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:09,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:50:09,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:50:09,852 INFO L87 Difference]: Start difference. First operand 797 states and 1146 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 19:50:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:10,259 INFO L93 Difference]: Finished difference Result 813 states and 1164 transitions. [2022-11-02 19:50:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:50:10,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 32 [2022-11-02 19:50:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:10,264 INFO L225 Difference]: With dead ends: 813 [2022-11-02 19:50:10,265 INFO L226 Difference]: Without dead ends: 813 [2022-11-02 19:50:10,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:50:10,266 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 690 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:10,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1099 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:10,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-11-02 19:50:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 797. [2022-11-02 19:50:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 659 states have (on average 1.4112291350531108) internal successors, (930), 666 states have internal predecessors, (930), 93 states have call successors, (93), 33 states have call predecessors, (93), 44 states have return successors, (121), 97 states have call predecessors, (121), 87 states have call successors, (121) [2022-11-02 19:50:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1144 transitions. [2022-11-02 19:50:10,298 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1144 transitions. Word has length 32 [2022-11-02 19:50:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:10,299 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1144 transitions. [2022-11-02 19:50:10,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 19:50:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1144 transitions. [2022-11-02 19:50:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 19:50:10,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:10,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:10,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 19:50:10,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash -509252101, now seen corresponding path program 1 times [2022-11-02 19:50:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:10,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192908162] [2022-11-02 19:50:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:10,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 19:50:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:10,406 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 19:50:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:10,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192908162] [2022-11-02 19:50:10,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192908162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:10,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:10,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:50:10,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183106925] [2022-11-02 19:50:10,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:10,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:50:10,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:10,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:50:10,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:50:10,408 INFO L87 Difference]: Start difference. First operand 797 states and 1144 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 19:50:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:11,217 INFO L93 Difference]: Finished difference Result 706 states and 1022 transitions. [2022-11-02 19:50:11,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:50:11,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-11-02 19:50:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:11,222 INFO L225 Difference]: With dead ends: 706 [2022-11-02 19:50:11,222 INFO L226 Difference]: Without dead ends: 706 [2022-11-02 19:50:11,222 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 19:50:11,223 INFO L413 NwaCegarLoop]: 711 mSDtfsCounter, 843 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:11,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1645 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 19:50:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-11-02 19:50:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 665. [2022-11-02 19:50:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 548 states have (on average 1.4087591240875912) internal successors, (772), 554 states have internal predecessors, (772), 85 states have call successors, (85), 26 states have call predecessors, (85), 31 states have return successors, (96), 84 states have call predecessors, (96), 79 states have call successors, (96) [2022-11-02 19:50:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 953 transitions. [2022-11-02 19:50:11,248 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 953 transitions. Word has length 36 [2022-11-02 19:50:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:11,249 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 953 transitions. [2022-11-02 19:50:11,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 19:50:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 953 transitions. [2022-11-02 19:50:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 19:50:11,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:11,252 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 19:50:11,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 19:50:11,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash 138801863, now seen corresponding path program 1 times [2022-11-02 19:50:11,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:11,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384285027] [2022-11-02 19:50:11,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:11,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:11,298 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 19:50:11,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:11,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384285027] [2022-11-02 19:50:11,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384285027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:11,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:11,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:50:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302171071] [2022-11-02 19:50:11,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:11,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:50:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:11,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:50:11,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:50:11,302 INFO L87 Difference]: Start difference. First operand 665 states and 953 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:11,384 INFO L93 Difference]: Finished difference Result 811 states and 1155 transitions. [2022-11-02 19:50:11,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:50:11,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 19:50:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:11,389 INFO L225 Difference]: With dead ends: 811 [2022-11-02 19:50:11,389 INFO L226 Difference]: Without dead ends: 811 [2022-11-02 19:50:11,390 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 19:50:11,390 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 132 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:11,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1370 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:50:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-11-02 19:50:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 713. [2022-11-02 19:50:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 592 states have (on average 1.385135135135135) internal successors, (820), 591 states have internal predecessors, (820), 85 states have call successors, (85), 26 states have call predecessors, (85), 35 states have return successors, (107), 95 states have call predecessors, (107), 79 states have call successors, (107) [2022-11-02 19:50:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1012 transitions. [2022-11-02 19:50:11,417 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1012 transitions. Word has length 34 [2022-11-02 19:50:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:11,417 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1012 transitions. [2022-11-02 19:50:11,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1012 transitions. [2022-11-02 19:50:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 19:50:11,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:11,420 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 19:50:11,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 19:50:11,421 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash -298326267, now seen corresponding path program 1 times [2022-11-02 19:50:11,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:11,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406437378] [2022-11-02 19:50:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:11,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:11,523 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 19:50:11,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:11,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406437378] [2022-11-02 19:50:11,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406437378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:11,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:11,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:50:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220326271] [2022-11-02 19:50:11,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:11,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:50:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:11,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:50:11,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:50:11,526 INFO L87 Difference]: Start difference. First operand 713 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:11,903 INFO L93 Difference]: Finished difference Result 694 states and 982 transitions. [2022-11-02 19:50:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:50:11,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 19:50:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:11,908 INFO L225 Difference]: With dead ends: 694 [2022-11-02 19:50:11,908 INFO L226 Difference]: Without dead ends: 694 [2022-11-02 19:50:11,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:50:11,912 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 670 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:11,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1099 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:50:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-11-02 19:50:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2022-11-02 19:50:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 575 states have (on average 1.3895652173913045) internal successors, (799), 581 states have internal predecessors, (799), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 19:50:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 982 transitions. [2022-11-02 19:50:11,941 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 982 transitions. Word has length 34 [2022-11-02 19:50:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:11,941 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 982 transitions. [2022-11-02 19:50:11,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:50:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 982 transitions. [2022-11-02 19:50:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 19:50:11,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:11,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:11,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 19:50:11,945 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 452395465, now seen corresponding path program 1 times [2022-11-02 19:50:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:11,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673228704] [2022-11-02 19:50:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:12,125 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 19:50:12,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:12,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673228704] [2022-11-02 19:50:12,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673228704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:12,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:12,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:50:12,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385974596] [2022-11-02 19:50:12,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:12,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:50:12,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:12,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:50:12,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:50:12,130 INFO L87 Difference]: Start difference. First operand 694 states and 982 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 19:50:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:12,491 INFO L93 Difference]: Finished difference Result 788 states and 1120 transitions. [2022-11-02 19:50:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:50:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 35 [2022-11-02 19:50:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:12,494 INFO L225 Difference]: With dead ends: 788 [2022-11-02 19:50:12,495 INFO L226 Difference]: Without dead ends: 788 [2022-11-02 19:50:12,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:50:12,495 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 742 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:12,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1192 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:50:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-11-02 19:50:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 696. [2022-11-02 19:50:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 577 states have (on average 1.3882149046793761) internal successors, (801), 583 states have internal predecessors, (801), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 19:50:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 984 transitions. [2022-11-02 19:50:12,516 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 984 transitions. Word has length 35 [2022-11-02 19:50:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:12,517 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 984 transitions. [2022-11-02 19:50:12,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 19:50:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 984 transitions. [2022-11-02 19:50:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 19:50:12,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:12,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:12,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 19:50:12,520 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:12,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash 452672295, now seen corresponding path program 1 times [2022-11-02 19:50:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:12,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754244444] [2022-11-02 19:50:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:12,642 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 19:50:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:12,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754244444] [2022-11-02 19:50:12,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754244444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:12,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:12,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:50:12,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769541936] [2022-11-02 19:50:12,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:12,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:50:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:12,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:50:12,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:50:12,644 INFO L87 Difference]: Start difference. First operand 696 states and 984 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 19:50:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:12,719 INFO L93 Difference]: Finished difference Result 706 states and 994 transitions. [2022-11-02 19:50:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:50:12,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 35 [2022-11-02 19:50:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:12,726 INFO L225 Difference]: With dead ends: 706 [2022-11-02 19:50:12,726 INFO L226 Difference]: Without dead ends: 679 [2022-11-02 19:50:12,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:50:12,727 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 38 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:12,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3193 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:50:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-11-02 19:50:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2022-11-02 19:50:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 560 states have (on average 1.394642857142857) internal successors, (781), 566 states have internal predecessors, (781), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 19:50:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 964 transitions. [2022-11-02 19:50:12,746 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 964 transitions. Word has length 35 [2022-11-02 19:50:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:12,747 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 964 transitions. [2022-11-02 19:50:12,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 19:50:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 964 transitions. [2022-11-02 19:50:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 19:50:12,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:12,749 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] [2022-11-02 19:50:12,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 19:50:12,749 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1898283434, now seen corresponding path program 1 times [2022-11-02 19:50:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593838571] [2022-11-02 19:50:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:12,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 19:50:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:12,801 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 19:50:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:12,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593838571] [2022-11-02 19:50:12,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593838571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:12,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:12,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:50:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008857514] [2022-11-02 19:50:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:12,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:50:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:50:12,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:50:12,804 INFO L87 Difference]: Start difference. First operand 679 states and 964 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 19:50:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:13,113 INFO L93 Difference]: Finished difference Result 712 states and 1022 transitions. [2022-11-02 19:50:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:50:13,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 37 [2022-11-02 19:50:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:13,117 INFO L225 Difference]: With dead ends: 712 [2022-11-02 19:50:13,117 INFO L226 Difference]: Without dead ends: 710 [2022-11-02 19:50:13,117 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 19:50:13,118 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 150 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:13,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1540 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:50:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-02 19:50:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 692. [2022-11-02 19:50:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 573 states have (on average 1.3891797556719023) internal successors, (796), 579 states have internal predecessors, (796), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 19:50:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 979 transitions. [2022-11-02 19:50:13,138 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 979 transitions. Word has length 37 [2022-11-02 19:50:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:13,139 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 979 transitions. [2022-11-02 19:50:13,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 19:50:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 979 transitions. [2022-11-02 19:50:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 19:50:13,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:13,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:13,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 19:50:13,142 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:13,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1374369595, now seen corresponding path program 1 times [2022-11-02 19:50:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:13,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201368290] [2022-11-02 19:50:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 19:50:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:13,337 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 19:50:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:13,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201368290] [2022-11-02 19:50:13,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201368290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:13,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:13,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:50:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215257729] [2022-11-02 19:50:13,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:13,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:50:13,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:13,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:50:13,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:50:13,340 INFO L87 Difference]: Start difference. First operand 692 states and 979 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 19:50:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:13,855 INFO L93 Difference]: Finished difference Result 710 states and 1019 transitions. [2022-11-02 19:50:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:13,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 39 [2022-11-02 19:50:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:13,859 INFO L225 Difference]: With dead ends: 710 [2022-11-02 19:50:13,859 INFO L226 Difference]: Without dead ends: 710 [2022-11-02 19:50:13,859 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 19:50:13,860 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 745 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:13,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1870 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:50:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-02 19:50:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 692. [2022-11-02 19:50:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 573 states have (on average 1.387434554973822) internal successors, (795), 579 states have internal predecessors, (795), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 19:50:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 978 transitions. [2022-11-02 19:50:13,879 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 978 transitions. Word has length 39 [2022-11-02 19:50:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:13,879 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 978 transitions. [2022-11-02 19:50:13,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 19:50:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 978 transitions. [2022-11-02 19:50:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 19:50:13,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:13,882 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 19:50:13,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 19:50:13,882 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -31152669, now seen corresponding path program 1 times [2022-11-02 19:50:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:13,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718283621] [2022-11-02 19:50:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:13,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 19:50:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:13,982 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 19:50:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:13,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718283621] [2022-11-02 19:50:13,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718283621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:13,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:13,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:50:13,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848588255] [2022-11-02 19:50:13,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:13,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:50:13,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:13,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:50:13,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:13,984 INFO L87 Difference]: Start difference. First operand 692 states and 978 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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 19:50:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:14,437 INFO L93 Difference]: Finished difference Result 728 states and 1040 transitions. [2022-11-02 19:50:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:50:14,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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 19:50:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:14,440 INFO L225 Difference]: With dead ends: 728 [2022-11-02 19:50:14,440 INFO L226 Difference]: Without dead ends: 699 [2022-11-02 19:50:14,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:14,441 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 158 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:14,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3958 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-11-02 19:50:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 683. [2022-11-02 19:50:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 566 states have (on average 1.3692579505300353) internal successors, (775), 572 states have internal predecessors, (775), 83 states have call successors, (83), 26 states have call predecessors, (83), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-11-02 19:50:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 954 transitions. [2022-11-02 19:50:14,461 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 954 transitions. Word has length 40 [2022-11-02 19:50:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:14,461 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 954 transitions. [2022-11-02 19:50:14,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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 19:50:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 954 transitions. [2022-11-02 19:50:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 19:50:14,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:14,464 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 19:50:14,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 19:50:14,464 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash 128291846, now seen corresponding path program 1 times [2022-11-02 19:50:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:14,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292731513] [2022-11-02 19:50:14,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:14,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:50:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:14,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:50:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:14,512 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 19:50:14,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:14,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292731513] [2022-11-02 19:50:14,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292731513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:14,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:14,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:50:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561626281] [2022-11-02 19:50:14,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:14,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:50:14,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:50:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:50:14,515 INFO L87 Difference]: Start difference. First operand 683 states and 954 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 19:50:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:15,000 INFO L93 Difference]: Finished difference Result 678 states and 964 transitions. [2022-11-02 19:50:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:15,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-11-02 19:50:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:15,003 INFO L225 Difference]: With dead ends: 678 [2022-11-02 19:50:15,003 INFO L226 Difference]: Without dead ends: 678 [2022-11-02 19:50:15,004 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 19:50:15,004 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 252 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:15,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1790 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-11-02 19:50:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 662. [2022-11-02 19:50:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 548 states have (on average 1.364963503649635) internal successors, (748), 553 states have internal predecessors, (748), 82 states have call successors, (82), 26 states have call predecessors, (82), 31 states have return successors, (94), 82 states have call predecessors, (94), 77 states have call successors, (94) [2022-11-02 19:50:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 924 transitions. [2022-11-02 19:50:15,024 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 924 transitions. Word has length 43 [2022-11-02 19:50:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:15,024 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 924 transitions. [2022-11-02 19:50:15,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 19:50:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 924 transitions. [2022-11-02 19:50:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 19:50:15,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:15,027 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 19:50:15,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 19:50:15,027 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash -37716100, now seen corresponding path program 1 times [2022-11-02 19:50:15,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:15,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549702566] [2022-11-02 19:50:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:50:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:15,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:15,327 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 19:50:15,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:15,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549702566] [2022-11-02 19:50:15,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549702566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:15,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:15,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 19:50:15,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394364123] [2022-11-02 19:50:15,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:15,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:50:15,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:15,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:50:15,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:50:15,329 INFO L87 Difference]: Start difference. First operand 662 states and 924 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 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 19:50:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:16,214 INFO L93 Difference]: Finished difference Result 689 states and 975 transitions. [2022-11-02 19:50:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:50:16,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 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 44 [2022-11-02 19:50:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:16,218 INFO L225 Difference]: With dead ends: 689 [2022-11-02 19:50:16,218 INFO L226 Difference]: Without dead ends: 676 [2022-11-02 19:50:16,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:16,218 INFO L413 NwaCegarLoop]: 608 mSDtfsCounter, 98 mSDsluCounter, 3829 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4437 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:16,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4437 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 19:50:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-02 19:50:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 660. [2022-11-02 19:50:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 547 states have (on average 1.363802559414991) internal successors, (746), 552 states have internal predecessors, (746), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-11-02 19:50:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 920 transitions. [2022-11-02 19:50:16,235 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 920 transitions. Word has length 44 [2022-11-02 19:50:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:16,236 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 920 transitions. [2022-11-02 19:50:16,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 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 19:50:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 920 transitions. [2022-11-02 19:50:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 19:50:16,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:16,238 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 19:50:16,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 19:50:16,239 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:16,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1983772567, now seen corresponding path program 1 times [2022-11-02 19:50:16,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:16,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965311465] [2022-11-02 19:50:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:16,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:16,507 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 19:50:16,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:16,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965311465] [2022-11-02 19:50:16,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965311465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:16,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:16,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 19:50:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900400524] [2022-11-02 19:50:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:16,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:50:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:16,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:50:16,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:50:16,511 INFO L87 Difference]: Start difference. First operand 660 states and 920 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 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 19:50:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:17,412 INFO L93 Difference]: Finished difference Result 686 states and 970 transitions. [2022-11-02 19:50:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:50:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 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 43 [2022-11-02 19:50:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:17,416 INFO L225 Difference]: With dead ends: 686 [2022-11-02 19:50:17,416 INFO L226 Difference]: Without dead ends: 673 [2022-11-02 19:50:17,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:17,416 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 98 mSDsluCounter, 3786 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:17,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4386 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 19:50:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-11-02 19:50:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 657. [2022-11-02 19:50:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 545 states have (on average 1.363302752293578) internal successors, (743), 550 states have internal predecessors, (743), 80 states have call successors, (80), 26 states have call predecessors, (80), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-11-02 19:50:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 915 transitions. [2022-11-02 19:50:17,435 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 915 transitions. Word has length 43 [2022-11-02 19:50:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:17,436 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 915 transitions. [2022-11-02 19:50:17,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 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 19:50:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 915 transitions. [2022-11-02 19:50:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 19:50:17,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:17,438 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] [2022-11-02 19:50:17,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 19:50:17,439 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:17,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash 724634571, now seen corresponding path program 1 times [2022-11-02 19:50:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:17,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131323729] [2022-11-02 19:50:17,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 19:50:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:17,727 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 19:50:17,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:17,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131323729] [2022-11-02 19:50:17,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131323729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:17,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:17,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 19:50:17,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985912465] [2022-11-02 19:50:17,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:17,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 19:50:17,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:17,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 19:50:17,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 19:50:17,730 INFO L87 Difference]: Start difference. First operand 657 states and 915 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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 19:50:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:18,932 INFO L93 Difference]: Finished difference Result 706 states and 990 transitions. [2022-11-02 19:50:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 19:50:18,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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 47 [2022-11-02 19:50:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:18,935 INFO L225 Difference]: With dead ends: 706 [2022-11-02 19:50:18,935 INFO L226 Difference]: Without dead ends: 689 [2022-11-02 19:50:18,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 19:50:18,936 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 244 mSDsluCounter, 4512 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 5102 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:18,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 5102 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 19:50:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-02 19:50:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 655. [2022-11-02 19:50:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 544 states have (on average 1.3621323529411764) internal successors, (741), 549 states have internal predecessors, (741), 79 states have call successors, (79), 26 states have call predecessors, (79), 31 states have return successors, (91), 79 states have call predecessors, (91), 74 states have call successors, (91) [2022-11-02 19:50:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 911 transitions. [2022-11-02 19:50:18,953 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 911 transitions. Word has length 47 [2022-11-02 19:50:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:18,953 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 911 transitions. [2022-11-02 19:50:18,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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 19:50:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 911 transitions. [2022-11-02 19:50:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 19:50:18,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:18,957 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 19:50:18,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 19:50:18,957 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1637865694, now seen corresponding path program 1 times [2022-11-02 19:50:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:18,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723436997] [2022-11-02 19:50:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:19,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:19,207 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 19:50:19,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:19,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723436997] [2022-11-02 19:50:19,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723436997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:19,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:19,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 19:50:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968096404] [2022-11-02 19:50:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:19,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 19:50:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:19,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 19:50:19,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 19:50:19,210 INFO L87 Difference]: Start difference. First operand 655 states and 911 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 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 19:50:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:20,269 INFO L93 Difference]: Finished difference Result 704 states and 986 transitions. [2022-11-02 19:50:20,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 19:50:20,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 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 44 [2022-11-02 19:50:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:20,273 INFO L225 Difference]: With dead ends: 704 [2022-11-02 19:50:20,273 INFO L226 Difference]: Without dead ends: 686 [2022-11-02 19:50:20,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 19:50:20,274 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 259 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:20,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 4624 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 19:50:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-11-02 19:50:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 654. [2022-11-02 19:50:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 543 states have (on average 1.3443830570902393) internal successors, (730), 548 states have internal predecessors, (730), 79 states have call successors, (79), 26 states have call predecessors, (79), 31 states have return successors, (91), 79 states have call predecessors, (91), 74 states have call successors, (91) [2022-11-02 19:50:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 900 transitions. [2022-11-02 19:50:20,298 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 900 transitions. Word has length 44 [2022-11-02 19:50:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:20,299 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 900 transitions. [2022-11-02 19:50:20,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 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 19:50:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 900 transitions. [2022-11-02 19:50:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 19:50:20,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:20,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, 1, 1] [2022-11-02 19:50:20,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 19:50:20,302 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1376070278, now seen corresponding path program 1 times [2022-11-02 19:50:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:20,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365852428] [2022-11-02 19:50:20,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:20,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 19:50:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:20,414 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 19:50:20,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:20,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365852428] [2022-11-02 19:50:20,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365852428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:20,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:20,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:50:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086168305] [2022-11-02 19:50:20,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:20,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:50:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:20,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:50:20,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:20,417 INFO L87 Difference]: Start difference. First operand 654 states and 900 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 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 19:50:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:20,838 INFO L93 Difference]: Finished difference Result 685 states and 955 transitions. [2022-11-02 19:50:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:50:20,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 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 19:50:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:20,842 INFO L225 Difference]: With dead ends: 685 [2022-11-02 19:50:20,842 INFO L226 Difference]: Without dead ends: 658 [2022-11-02 19:50:20,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:20,842 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 158 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3662 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:20,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3662 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-02 19:50:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 642. [2022-11-02 19:50:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 534 states have (on average 1.3389513108614233) internal successors, (715), 539 states have internal predecessors, (715), 76 states have call successors, (76), 26 states have call predecessors, (76), 31 states have return successors, (88), 76 states have call predecessors, (88), 71 states have call successors, (88) [2022-11-02 19:50:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 879 transitions. [2022-11-02 19:50:20,858 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 879 transitions. Word has length 44 [2022-11-02 19:50:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:20,859 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 879 transitions. [2022-11-02 19:50:20,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 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 19:50:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 879 transitions. [2022-11-02 19:50:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 19:50:20,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:20,861 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] [2022-11-02 19:50:20,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 19:50:20,861 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash -766417177, now seen corresponding path program 1 times [2022-11-02 19:50:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:20,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805250470] [2022-11-02 19:50:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:50:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:20,925 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 19:50:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:20,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805250470] [2022-11-02 19:50:20,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805250470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:20,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:20,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:50:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826332262] [2022-11-02 19:50:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:20,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:50:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:50:20,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:50:20,928 INFO L87 Difference]: Start difference. First operand 642 states and 879 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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 19:50:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:21,422 INFO L93 Difference]: Finished difference Result 693 states and 983 transitions. [2022-11-02 19:50:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:50:21,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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 45 [2022-11-02 19:50:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:21,426 INFO L225 Difference]: With dead ends: 693 [2022-11-02 19:50:21,426 INFO L226 Difference]: Without dead ends: 693 [2022-11-02 19:50:21,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:50:21,427 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 134 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:21,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2188 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-11-02 19:50:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 649. [2022-11-02 19:50:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 539 states have (on average 1.339517625231911) internal successors, (722), 545 states have internal predecessors, (722), 77 states have call successors, (77), 26 states have call predecessors, (77), 32 states have return successors, (95), 77 states have call predecessors, (95), 72 states have call successors, (95) [2022-11-02 19:50:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 894 transitions. [2022-11-02 19:50:21,448 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 894 transitions. Word has length 45 [2022-11-02 19:50:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:21,449 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 894 transitions. [2022-11-02 19:50:21,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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 19:50:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 894 transitions. [2022-11-02 19:50:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 19:50:21,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:21,453 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] [2022-11-02 19:50:21,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 19:50:21,453 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1275890267, now seen corresponding path program 1 times [2022-11-02 19:50:21,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:21,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135626073] [2022-11-02 19:50:21,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:21,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:21,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:50:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:21,574 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 19:50:21,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135626073] [2022-11-02 19:50:21,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135626073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:21,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:21,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:50:21,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61751572] [2022-11-02 19:50:21,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:21,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:50:21,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:21,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:50:21,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:50:21,578 INFO L87 Difference]: Start difference. First operand 649 states and 894 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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 19:50:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:22,124 INFO L93 Difference]: Finished difference Result 684 states and 959 transitions. [2022-11-02 19:50:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 19:50:22,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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 45 [2022-11-02 19:50:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:22,130 INFO L225 Difference]: With dead ends: 684 [2022-11-02 19:50:22,131 INFO L226 Difference]: Without dead ends: 667 [2022-11-02 19:50:22,131 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 19:50:22,132 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 161 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:22,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 3793 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:50:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-02 19:50:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 647. [2022-11-02 19:50:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 538 states have (on average 1.338289962825279) internal successors, (720), 544 states have internal predecessors, (720), 76 states have call successors, (76), 26 states have call predecessors, (76), 32 states have return successors, (94), 76 states have call predecessors, (94), 71 states have call successors, (94) [2022-11-02 19:50:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 890 transitions. [2022-11-02 19:50:22,167 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 890 transitions. Word has length 45 [2022-11-02 19:50:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:22,168 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 890 transitions. [2022-11-02 19:50:22,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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 19:50:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 890 transitions. [2022-11-02 19:50:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 19:50:22,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:22,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] [2022-11-02 19:50:22,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 19:50:22,174 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:22,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:22,175 INFO L85 PathProgramCache]: Analyzing trace with hash -499982008, now seen corresponding path program 1 times [2022-11-02 19:50:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:22,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567978390] [2022-11-02 19:50:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:22,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:50:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,307 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 19:50:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:22,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567978390] [2022-11-02 19:50:22,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567978390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:22,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:22,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:50:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717117870] [2022-11-02 19:50:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:50:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:50:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:22,310 INFO L87 Difference]: Start difference. First operand 647 states and 890 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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 19:50:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:22,697 INFO L93 Difference]: Finished difference Result 691 states and 969 transitions. [2022-11-02 19:50:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:50:22,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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 45 [2022-11-02 19:50:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:22,701 INFO L225 Difference]: With dead ends: 691 [2022-11-02 19:50:22,701 INFO L226 Difference]: Without dead ends: 659 [2022-11-02 19:50:22,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:22,702 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 166 mSDsluCounter, 2963 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:22,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 3513 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:50:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-11-02 19:50:22,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 639. [2022-11-02 19:50:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 532 states have (on average 1.330827067669173) internal successors, (708), 538 states have internal predecessors, (708), 74 states have call successors, (74), 26 states have call predecessors, (74), 32 states have return successors, (92), 74 states have call predecessors, (92), 69 states have call successors, (92) [2022-11-02 19:50:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 874 transitions. [2022-11-02 19:50:22,720 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 874 transitions. Word has length 45 [2022-11-02 19:50:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:22,720 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 874 transitions. [2022-11-02 19:50:22,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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 19:50:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 874 transitions. [2022-11-02 19:50:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 19:50:22,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:22,723 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 19:50:22,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 19:50:22,723 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:22,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1469834137, now seen corresponding path program 1 times [2022-11-02 19:50:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:22,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678948167] [2022-11-02 19:50:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:22,980 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 19:50:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:22,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678948167] [2022-11-02 19:50:22,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678948167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:22,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:22,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 19:50:22,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203962959] [2022-11-02 19:50:22,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:22,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 19:50:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:22,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 19:50:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:50:22,983 INFO L87 Difference]: Start difference. First operand 639 states and 874 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 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 19:50:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:24,110 INFO L93 Difference]: Finished difference Result 671 states and 936 transitions. [2022-11-02 19:50:24,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:50:24,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 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 46 [2022-11-02 19:50:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:24,114 INFO L225 Difference]: With dead ends: 671 [2022-11-02 19:50:24,115 INFO L226 Difference]: Without dead ends: 656 [2022-11-02 19:50:24,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:50:24,116 INFO L413 NwaCegarLoop]: 541 mSDtfsCounter, 110 mSDsluCounter, 3749 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 4290 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:24,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 4290 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 19:50:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-11-02 19:50:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 636. [2022-11-02 19:50:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 530 states have (on average 1.330188679245283) internal successors, (705), 536 states have internal predecessors, (705), 73 states have call successors, (73), 26 states have call predecessors, (73), 32 states have return successors, (91), 73 states have call predecessors, (91), 68 states have call successors, (91) [2022-11-02 19:50:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 869 transitions. [2022-11-02 19:50:24,137 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 869 transitions. Word has length 46 [2022-11-02 19:50:24,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:24,137 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 869 transitions. [2022-11-02 19:50:24,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 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 19:50:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 869 transitions. [2022-11-02 19:50:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 19:50:24,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:24,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] [2022-11-02 19:50:24,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 19:50:24,141 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1528127283, now seen corresponding path program 1 times [2022-11-02 19:50:24,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:24,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585249384] [2022-11-02 19:50:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:24,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:24,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 19:50:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:24,239 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 19:50:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:24,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585249384] [2022-11-02 19:50:24,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585249384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:24,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:24,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637170986] [2022-11-02 19:50:24,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:24,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:24,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:24,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:24,242 INFO L87 Difference]: Start difference. First operand 636 states and 869 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 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 19:50:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:24,731 INFO L93 Difference]: Finished difference Result 668 states and 950 transitions. [2022-11-02 19:50:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:24,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 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 46 [2022-11-02 19:50:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:24,735 INFO L225 Difference]: With dead ends: 668 [2022-11-02 19:50:24,736 INFO L226 Difference]: Without dead ends: 666 [2022-11-02 19:50:24,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:24,737 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 187 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:24,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 2295 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-02 19:50:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 640. [2022-11-02 19:50:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 532 states have (on average 1.3289473684210527) internal successors, (707), 540 states have internal predecessors, (707), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (107), 73 states have call predecessors, (107), 68 states have call successors, (107) [2022-11-02 19:50:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 887 transitions. [2022-11-02 19:50:24,761 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 887 transitions. Word has length 46 [2022-11-02 19:50:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:24,762 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 887 transitions. [2022-11-02 19:50:24,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 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 19:50:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 887 transitions. [2022-11-02 19:50:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 19:50:24,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:24,765 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] [2022-11-02 19:50:24,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 19:50:24,766 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash 43125576, now seen corresponding path program 1 times [2022-11-02 19:50:24,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:24,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686591405] [2022-11-02 19:50:24,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:25,137 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 19:50:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:25,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686591405] [2022-11-02 19:50:25,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686591405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:25,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:25,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 19:50:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957265406] [2022-11-02 19:50:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:25,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:50:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:25,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:50:25,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:25,143 INFO L87 Difference]: Start difference. First operand 640 states and 887 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 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 19:50:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:26,413 INFO L93 Difference]: Finished difference Result 672 states and 949 transitions. [2022-11-02 19:50:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 19:50:26,414 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 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 47 [2022-11-02 19:50:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:26,418 INFO L225 Difference]: With dead ends: 672 [2022-11-02 19:50:26,418 INFO L226 Difference]: Without dead ends: 657 [2022-11-02 19:50:26,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 19:50:26,420 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 123 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:26,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4660 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 19:50:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-11-02 19:50:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 637. [2022-11-02 19:50:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 530 states have (on average 1.3283018867924528) internal successors, (704), 538 states have internal predecessors, (704), 72 states have call successors, (72), 26 states have call predecessors, (72), 34 states have return successors, (106), 72 states have call predecessors, (106), 67 states have call successors, (106) [2022-11-02 19:50:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 882 transitions. [2022-11-02 19:50:26,447 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 882 transitions. Word has length 47 [2022-11-02 19:50:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:26,448 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 882 transitions. [2022-11-02 19:50:26,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 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 19:50:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 882 transitions. [2022-11-02 19:50:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 19:50:26,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:26,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:26,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 19:50:26,451 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 973189000, now seen corresponding path program 1 times [2022-11-02 19:50:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:26,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784832252] [2022-11-02 19:50:26,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 19:50:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:50:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:50:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:26,563 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 19:50:26,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:26,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784832252] [2022-11-02 19:50:26,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784832252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:26,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:26,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:50:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688338373] [2022-11-02 19:50:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:26,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:50:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:26,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:50:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:50:26,566 INFO L87 Difference]: Start difference. First operand 637 states and 882 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 19:50:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:27,194 INFO L93 Difference]: Finished difference Result 748 states and 1043 transitions. [2022-11-02 19:50:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:27,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-11-02 19:50:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:27,198 INFO L225 Difference]: With dead ends: 748 [2022-11-02 19:50:27,199 INFO L226 Difference]: Without dead ends: 748 [2022-11-02 19:50:27,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:27,200 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 241 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:27,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1660 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 19:50:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-02 19:50:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 701. [2022-11-02 19:50:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 584 states have (on average 1.327054794520548) internal successors, (775), 592 states have internal predecessors, (775), 75 states have call successors, (75), 30 states have call predecessors, (75), 41 states have return successors, (115), 78 states have call predecessors, (115), 71 states have call successors, (115) [2022-11-02 19:50:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 965 transitions. [2022-11-02 19:50:27,223 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 965 transitions. Word has length 50 [2022-11-02 19:50:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:27,224 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 965 transitions. [2022-11-02 19:50:27,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 19:50:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 965 transitions. [2022-11-02 19:50:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 19:50:27,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:27,227 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] [2022-11-02 19:50:27,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 19:50:27,228 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:27,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash -261050894, now seen corresponding path program 1 times [2022-11-02 19:50:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:27,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164125149] [2022-11-02 19:50:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:50:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:27,485 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 19:50:27,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:27,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164125149] [2022-11-02 19:50:27,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164125149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:27,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:27,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 19:50:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503662628] [2022-11-02 19:50:27,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:27,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 19:50:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:27,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 19:50:27,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:50:27,487 INFO L87 Difference]: Start difference. First operand 701 states and 965 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:28,688 INFO L93 Difference]: Finished difference Result 762 states and 1058 transitions. [2022-11-02 19:50:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 19:50:28,688 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-11-02 19:50:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:28,691 INFO L225 Difference]: With dead ends: 762 [2022-11-02 19:50:28,691 INFO L226 Difference]: Without dead ends: 745 [2022-11-02 19:50:28,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:50:28,692 INFO L413 NwaCegarLoop]: 522 mSDtfsCounter, 248 mSDsluCounter, 4122 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:28,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 4644 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 19:50:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-11-02 19:50:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 699. [2022-11-02 19:50:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 583 states have (on average 1.3259005145797598) internal successors, (773), 591 states have internal predecessors, (773), 74 states have call successors, (74), 30 states have call predecessors, (74), 41 states have return successors, (114), 77 states have call predecessors, (114), 70 states have call successors, (114) [2022-11-02 19:50:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 961 transitions. [2022-11-02 19:50:28,710 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 961 transitions. Word has length 52 [2022-11-02 19:50:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:28,711 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 961 transitions. [2022-11-02 19:50:28,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 961 transitions. [2022-11-02 19:50:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 19:50:28,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:28,713 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 19:50:28,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 19:50:28,714 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash 721425391, now seen corresponding path program 1 times [2022-11-02 19:50:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:28,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377338665] [2022-11-02 19:50:28,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:28,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:28,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 19:50:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:28,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:28,947 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 19:50:28,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:28,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377338665] [2022-11-02 19:50:28,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377338665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:28,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:28,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 19:50:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851544166] [2022-11-02 19:50:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:28,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 19:50:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 19:50:28,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:50:28,949 INFO L87 Difference]: Start difference. First operand 699 states and 961 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:30,181 INFO L93 Difference]: Finished difference Result 760 states and 1054 transitions. [2022-11-02 19:50:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 19:50:30,181 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-11-02 19:50:30,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:30,185 INFO L225 Difference]: With dead ends: 760 [2022-11-02 19:50:30,185 INFO L226 Difference]: Without dead ends: 743 [2022-11-02 19:50:30,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:50:30,186 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 247 mSDsluCounter, 4103 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 4622 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:30,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 4622 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 19:50:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-02 19:50:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 697. [2022-11-02 19:50:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 582 states have (on average 1.324742268041237) internal successors, (771), 590 states have internal predecessors, (771), 73 states have call successors, (73), 30 states have call predecessors, (73), 41 states have return successors, (113), 76 states have call predecessors, (113), 69 states have call successors, (113) [2022-11-02 19:50:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 957 transitions. [2022-11-02 19:50:30,204 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 957 transitions. Word has length 51 [2022-11-02 19:50:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:30,205 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 957 transitions. [2022-11-02 19:50:30,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 957 transitions. [2022-11-02 19:50:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 19:50:30,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:30,207 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 19:50:30,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 19:50:30,207 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:30,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash 618682838, now seen corresponding path program 1 times [2022-11-02 19:50:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:30,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608194300] [2022-11-02 19:50:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:50:30,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:30,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608194300] [2022-11-02 19:50:30,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608194300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:30,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:30,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 19:50:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118517569] [2022-11-02 19:50:30,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:30,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 19:50:30,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:30,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 19:50:30,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 19:50:30,422 INFO L87 Difference]: Start difference. First operand 697 states and 957 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 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 19:50:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:31,499 INFO L93 Difference]: Finished difference Result 742 states and 1033 transitions. [2022-11-02 19:50:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 19:50:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 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 48 [2022-11-02 19:50:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:31,502 INFO L225 Difference]: With dead ends: 742 [2022-11-02 19:50:31,502 INFO L226 Difference]: Without dead ends: 725 [2022-11-02 19:50:31,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 19:50:31,502 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 149 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 4593 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:31,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 4593 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 19:50:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-11-02 19:50:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 695. [2022-11-02 19:50:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 581 states have (on average 1.3235800344234079) internal successors, (769), 589 states have internal predecessors, (769), 72 states have call successors, (72), 30 states have call predecessors, (72), 41 states have return successors, (112), 75 states have call predecessors, (112), 68 states have call successors, (112) [2022-11-02 19:50:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 953 transitions. [2022-11-02 19:50:31,519 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 953 transitions. Word has length 48 [2022-11-02 19:50:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:31,519 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 953 transitions. [2022-11-02 19:50:31,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 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 19:50:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 953 transitions. [2022-11-02 19:50:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 19:50:31,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:31,522 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 19:50:31,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 19:50:31,522 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:31,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1166693008, now seen corresponding path program 1 times [2022-11-02 19:50:31,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:31,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41921087] [2022-11-02 19:50:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:31,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 19:50:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:31,581 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 19:50:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41921087] [2022-11-02 19:50:31,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41921087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:31,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:31,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:50:31,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792509483] [2022-11-02 19:50:31,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:31,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:50:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:31,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:50:31,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:50:31,585 INFO L87 Difference]: Start difference. First operand 695 states and 953 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 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 19:50:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:31,842 INFO L93 Difference]: Finished difference Result 654 states and 878 transitions. [2022-11-02 19:50:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:50:31,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 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 48 [2022-11-02 19:50:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:31,845 INFO L225 Difference]: With dead ends: 654 [2022-11-02 19:50:31,845 INFO L226 Difference]: Without dead ends: 651 [2022-11-02 19:50:31,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:50:31,845 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 174 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:31,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1267 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:50:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-11-02 19:50:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 622. [2022-11-02 19:50:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 524 states have (on average 1.3187022900763359) internal successors, (691), 530 states have internal predecessors, (691), 63 states have call successors, (63), 27 states have call predecessors, (63), 34 states have return successors, (76), 64 states have call predecessors, (76), 59 states have call successors, (76) [2022-11-02 19:50:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 830 transitions. [2022-11-02 19:50:31,869 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 830 transitions. Word has length 48 [2022-11-02 19:50:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:31,870 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 830 transitions. [2022-11-02 19:50:31,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 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 19:50:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 830 transitions. [2022-11-02 19:50:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 19:50:31,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:31,872 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] [2022-11-02 19:50:31,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 19:50:31,872 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:31,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:31,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1152872609, now seen corresponding path program 1 times [2022-11-02 19:50:31,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:31,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214425158] [2022-11-02 19:50:31,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 19:50:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:32,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:32,161 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 19:50:32,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:32,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214425158] [2022-11-02 19:50:32,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214425158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:32,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:32,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 19:50:32,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814345925] [2022-11-02 19:50:32,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:32,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:50:32,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:32,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:50:32,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:32,165 INFO L87 Difference]: Start difference. First operand 622 states and 830 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 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 19:50:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:33,141 INFO L93 Difference]: Finished difference Result 647 states and 863 transitions. [2022-11-02 19:50:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 19:50:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 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 57 [2022-11-02 19:50:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:33,144 INFO L225 Difference]: With dead ends: 647 [2022-11-02 19:50:33,144 INFO L226 Difference]: Without dead ends: 632 [2022-11-02 19:50:33,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 19:50:33,145 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 116 mSDsluCounter, 3861 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 4361 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:33,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 4361 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 19:50:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-11-02 19:50:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2022-11-02 19:50:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 523 states have (on average 1.3173996175908222) internal successors, (689), 529 states have internal predecessors, (689), 62 states have call successors, (62), 27 states have call predecessors, (62), 34 states have return successors, (75), 63 states have call predecessors, (75), 58 states have call successors, (75) [2022-11-02 19:50:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 826 transitions. [2022-11-02 19:50:33,160 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 826 transitions. Word has length 57 [2022-11-02 19:50:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:33,161 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 826 transitions. [2022-11-02 19:50:33,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 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 19:50:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 826 transitions. [2022-11-02 19:50:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 19:50:33,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:33,163 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 19:50:33,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 19:50:33,164 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:33,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1985597816, now seen corresponding path program 1 times [2022-11-02 19:50:33,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:33,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948205436] [2022-11-02 19:50:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:33,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:33,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:50:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:33,493 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 19:50:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948205436] [2022-11-02 19:50:33,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948205436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:33,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:33,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 19:50:33,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310932553] [2022-11-02 19:50:33,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:33,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:50:33,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:33,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:50:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:33,497 INFO L87 Difference]: Start difference. First operand 620 states and 826 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 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 19:50:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:34,587 INFO L93 Difference]: Finished difference Result 644 states and 858 transitions. [2022-11-02 19:50:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 19:50:34,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 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 48 [2022-11-02 19:50:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:34,590 INFO L225 Difference]: With dead ends: 644 [2022-11-02 19:50:34,590 INFO L226 Difference]: Without dead ends: 629 [2022-11-02 19:50:34,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 19:50:34,592 INFO L413 NwaCegarLoop]: 492 mSDtfsCounter, 116 mSDsluCounter, 3814 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 4306 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:34,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 4306 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 19:50:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-11-02 19:50:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 617. [2022-11-02 19:50:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 521 states have (on average 1.3166986564299423) internal successors, (686), 527 states have internal predecessors, (686), 61 states have call successors, (61), 27 states have call predecessors, (61), 34 states have return successors, (74), 62 states have call predecessors, (74), 57 states have call successors, (74) [2022-11-02 19:50:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 821 transitions. [2022-11-02 19:50:34,610 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 821 transitions. Word has length 48 [2022-11-02 19:50:34,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:34,610 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 821 transitions. [2022-11-02 19:50:34,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 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 19:50:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 821 transitions. [2022-11-02 19:50:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 19:50:34,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:34,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:34,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 19:50:34,613 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:34,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1806708367, now seen corresponding path program 1 times [2022-11-02 19:50:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:34,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504806396] [2022-11-02 19:50:34,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:34,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:50:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 19:50:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:34,707 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 19:50:34,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:34,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504806396] [2022-11-02 19:50:34,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504806396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:34,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:34,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615095795] [2022-11-02 19:50:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:34,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:34,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:34,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:34,711 INFO L87 Difference]: Start difference. First operand 617 states and 821 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 19:50:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:35,197 INFO L93 Difference]: Finished difference Result 694 states and 917 transitions. [2022-11-02 19:50:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:35,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 50 [2022-11-02 19:50:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:35,211 INFO L225 Difference]: With dead ends: 694 [2022-11-02 19:50:35,218 INFO L226 Difference]: Without dead ends: 694 [2022-11-02 19:50:35,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:50:35,220 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 334 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:35,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 2087 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:35,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-11-02 19:50:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 623. [2022-11-02 19:50:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 526 states have (on average 1.3155893536121672) internal successors, (692), 532 states have internal predecessors, (692), 62 states have call successors, (62), 27 states have call predecessors, (62), 34 states have return successors, (75), 63 states have call predecessors, (75), 58 states have call successors, (75) [2022-11-02 19:50:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 829 transitions. [2022-11-02 19:50:35,243 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 829 transitions. Word has length 50 [2022-11-02 19:50:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:35,243 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 829 transitions. [2022-11-02 19:50:35,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 19:50:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 829 transitions. [2022-11-02 19:50:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 19:50:35,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:35,246 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 19:50:35,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 19:50:35,246 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:35,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:35,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1801199632, now seen corresponding path program 1 times [2022-11-02 19:50:35,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:35,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067835960] [2022-11-02 19:50:35,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:35,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:35,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:50:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:35,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:50:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:35,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:50:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:50:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:35,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067835960] [2022-11-02 19:50:35,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067835960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:35,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:35,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:50:35,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274224947] [2022-11-02 19:50:35,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:35,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:50:35,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:35,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:50:35,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:50:35,396 INFO L87 Difference]: Start difference. First operand 623 states and 829 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 19:50:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:35,926 INFO L93 Difference]: Finished difference Result 635 states and 847 transitions. [2022-11-02 19:50:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:50:35,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-11-02 19:50:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:35,929 INFO L225 Difference]: With dead ends: 635 [2022-11-02 19:50:35,929 INFO L226 Difference]: Without dead ends: 635 [2022-11-02 19:50:35,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:50:35,930 INFO L413 NwaCegarLoop]: 473 mSDtfsCounter, 197 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:35,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1443 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:50:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-11-02 19:50:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 623. [2022-11-02 19:50:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 526 states have (on average 1.311787072243346) internal successors, (690), 532 states have internal predecessors, (690), 62 states have call successors, (62), 27 states have call predecessors, (62), 34 states have return successors, (75), 63 states have call predecessors, (75), 58 states have call successors, (75) [2022-11-02 19:50:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 827 transitions. [2022-11-02 19:50:35,945 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 827 transitions. Word has length 53 [2022-11-02 19:50:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:35,945 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 827 transitions. [2022-11-02 19:50:35,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 19:50:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 827 transitions. [2022-11-02 19:50:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 19:50:35,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:35,949 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 19:50:35,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 19:50:35,950 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1698213256, now seen corresponding path program 1 times [2022-11-02 19:50:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:35,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009232380] [2022-11-02 19:50:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:36,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:50:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:50:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:36,066 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 19:50:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:36,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009232380] [2022-11-02 19:50:36,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009232380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:36,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:36,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:50:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894028425] [2022-11-02 19:50:36,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:36,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:50:36,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:36,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:50:36,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:50:36,068 INFO L87 Difference]: Start difference. First operand 623 states and 827 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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 19:50:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:36,713 INFO L93 Difference]: Finished difference Result 666 states and 884 transitions. [2022-11-02 19:50:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 19:50:36,714 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), 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 51 [2022-11-02 19:50:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:36,716 INFO L225 Difference]: With dead ends: 666 [2022-11-02 19:50:36,716 INFO L226 Difference]: Without dead ends: 615 [2022-11-02 19:50:36,717 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 19:50:36,717 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 185 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:36,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 3129 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 19:50:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-11-02 19:50:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 596. [2022-11-02 19:50:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 504 states have (on average 1.2976190476190477) internal successors, (654), 510 states have internal predecessors, (654), 57 states have call successors, (57), 27 states have call predecessors, (57), 34 states have return successors, (69), 58 states have call predecessors, (69), 53 states have call successors, (69) [2022-11-02 19:50:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 780 transitions. [2022-11-02 19:50:36,739 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 780 transitions. Word has length 51 [2022-11-02 19:50:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:36,740 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 780 transitions. [2022-11-02 19:50:36,740 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), 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 19:50:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 780 transitions. [2022-11-02 19:50:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 19:50:36,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:36,744 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 19:50:36,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 19:50:36,745 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:36,745 INFO L85 PathProgramCache]: Analyzing trace with hash 673526006, now seen corresponding path program 1 times [2022-11-02 19:50:36,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:36,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477288100] [2022-11-02 19:50:36,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:36,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:36,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 19:50:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:50:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:36,861 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 19:50:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:36,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477288100] [2022-11-02 19:50:36,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477288100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:36,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:36,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973687370] [2022-11-02 19:50:36,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:36,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:36,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:36,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:36,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:36,864 INFO L87 Difference]: Start difference. First operand 596 states and 780 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 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 19:50:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:37,341 INFO L93 Difference]: Finished difference Result 602 states and 788 transitions. [2022-11-02 19:50:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:37,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 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 51 [2022-11-02 19:50:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:37,344 INFO L225 Difference]: With dead ends: 602 [2022-11-02 19:50:37,344 INFO L226 Difference]: Without dead ends: 602 [2022-11-02 19:50:37,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:37,345 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 98 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:37,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2044 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-11-02 19:50:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 586. [2022-11-02 19:50:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 496 states have (on average 1.2943548387096775) internal successors, (642), 502 states have internal predecessors, (642), 55 states have call successors, (55), 27 states have call predecessors, (55), 34 states have return successors, (67), 56 states have call predecessors, (67), 51 states have call successors, (67) [2022-11-02 19:50:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 764 transitions. [2022-11-02 19:50:37,363 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 764 transitions. Word has length 51 [2022-11-02 19:50:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:37,363 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 764 transitions. [2022-11-02 19:50:37,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 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 19:50:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 764 transitions. [2022-11-02 19:50:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 19:50:37,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:37,366 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] [2022-11-02 19:50:37,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 19:50:37,367 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:37,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1072773224, now seen corresponding path program 1 times [2022-11-02 19:50:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:37,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328014222] [2022-11-02 19:50:37,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:37,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 19:50:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:37,486 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 19:50:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:37,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328014222] [2022-11-02 19:50:37,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328014222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:37,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:37,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516646822] [2022-11-02 19:50:37,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:37,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:37,489 INFO L87 Difference]: Start difference. First operand 586 states and 764 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 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 19:50:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:37,883 INFO L93 Difference]: Finished difference Result 598 states and 782 transitions. [2022-11-02 19:50:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:37,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 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 52 [2022-11-02 19:50:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:37,885 INFO L225 Difference]: With dead ends: 598 [2022-11-02 19:50:37,885 INFO L226 Difference]: Without dead ends: 593 [2022-11-02 19:50:37,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:37,886 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 171 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:37,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1791 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-11-02 19:50:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 581. [2022-11-02 19:50:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 492 states have (on average 1.2947154471544715) internal successors, (637), 498 states have internal predecessors, (637), 54 states have call successors, (54), 27 states have call predecessors, (54), 34 states have return successors, (66), 55 states have call predecessors, (66), 50 states have call successors, (66) [2022-11-02 19:50:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 757 transitions. [2022-11-02 19:50:37,899 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 757 transitions. Word has length 52 [2022-11-02 19:50:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:37,900 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 757 transitions. [2022-11-02 19:50:37,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 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 19:50:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 757 transitions. [2022-11-02 19:50:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 19:50:37,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:37,902 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] [2022-11-02 19:50:37,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 19:50:37,903 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:37,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:37,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527003, now seen corresponding path program 1 times [2022-11-02 19:50:37,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:37,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772487681] [2022-11-02 19:50:37,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:37,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:37,964 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 19:50:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:37,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772487681] [2022-11-02 19:50:37,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772487681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:37,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:37,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:50:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872684500] [2022-11-02 19:50:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:37,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:50:37,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:37,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:50:37,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:50:37,967 INFO L87 Difference]: Start difference. First operand 581 states and 757 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 19:50:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:38,409 INFO L93 Difference]: Finished difference Result 690 states and 901 transitions. [2022-11-02 19:50:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 52 [2022-11-02 19:50:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:38,411 INFO L225 Difference]: With dead ends: 690 [2022-11-02 19:50:38,411 INFO L226 Difference]: Without dead ends: 690 [2022-11-02 19:50:38,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:38,412 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 215 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:38,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1360 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-11-02 19:50:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 609. [2022-11-02 19:50:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 518 states have (on average 1.2895752895752897) internal successors, (668), 524 states have internal predecessors, (668), 54 states have call successors, (54), 27 states have call predecessors, (54), 36 states have return successors, (68), 57 states have call predecessors, (68), 50 states have call successors, (68) [2022-11-02 19:50:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 790 transitions. [2022-11-02 19:50:38,427 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 790 transitions. Word has length 52 [2022-11-02 19:50:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:38,428 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 790 transitions. [2022-11-02 19:50:38,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 19:50:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 790 transitions. [2022-11-02 19:50:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 19:50:38,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:38,430 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 19:50:38,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 19:50:38,431 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2075413267, now seen corresponding path program 1 times [2022-11-02 19:50:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:38,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85313287] [2022-11-02 19:50:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:38,533 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 19:50:38,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:38,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85313287] [2022-11-02 19:50:38,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85313287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:38,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:38,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:38,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364474510] [2022-11-02 19:50:38,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:38,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:38,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:38,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:38,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:38,536 INFO L87 Difference]: Start difference. First operand 609 states and 790 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 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 19:50:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:39,201 INFO L93 Difference]: Finished difference Result 688 states and 898 transitions. [2022-11-02 19:50:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 19:50:39,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 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 53 [2022-11-02 19:50:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:39,203 INFO L225 Difference]: With dead ends: 688 [2022-11-02 19:50:39,203 INFO L226 Difference]: Without dead ends: 688 [2022-11-02 19:50:39,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:39,204 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 785 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:39,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1309 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 19:50:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-11-02 19:50:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 609. [2022-11-02 19:50:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 518 states have (on average 1.2876447876447876) internal successors, (667), 524 states have internal predecessors, (667), 54 states have call successors, (54), 27 states have call predecessors, (54), 36 states have return successors, (68), 57 states have call predecessors, (68), 50 states have call successors, (68) [2022-11-02 19:50:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 789 transitions. [2022-11-02 19:50:39,226 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 789 transitions. Word has length 53 [2022-11-02 19:50:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:39,227 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 789 transitions. [2022-11-02 19:50:39,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 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 19:50:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 789 transitions. [2022-11-02 19:50:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 19:50:39,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:39,229 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 19:50:39,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 19:50:39,230 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash 726957118, now seen corresponding path program 1 times [2022-11-02 19:50:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:39,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294006855] [2022-11-02 19:50:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:39,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 19:50:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 19:50:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:39,510 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 19:50:39,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:39,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294006855] [2022-11-02 19:50:39,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294006855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:39,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:39,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 19:50:39,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884520689] [2022-11-02 19:50:39,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:39,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 19:50:39,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:39,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 19:50:39,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:50:39,513 INFO L87 Difference]: Start difference. First operand 609 states and 789 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 19:50:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:40,629 INFO L93 Difference]: Finished difference Result 661 states and 854 transitions. [2022-11-02 19:50:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 19:50:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2022-11-02 19:50:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:40,632 INFO L225 Difference]: With dead ends: 661 [2022-11-02 19:50:40,632 INFO L226 Difference]: Without dead ends: 644 [2022-11-02 19:50:40,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:50:40,633 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 278 mSDsluCounter, 3067 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 3495 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:40,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 3495 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 19:50:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-11-02 19:50:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 607. [2022-11-02 19:50:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 517 states have (on average 1.2862669245647969) internal successors, (665), 523 states have internal predecessors, (665), 53 states have call successors, (53), 27 states have call predecessors, (53), 36 states have return successors, (67), 56 states have call predecessors, (67), 49 states have call successors, (67) [2022-11-02 19:50:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 785 transitions. [2022-11-02 19:50:40,648 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 785 transitions. Word has length 59 [2022-11-02 19:50:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:40,648 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 785 transitions. [2022-11-02 19:50:40,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 19:50:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 785 transitions. [2022-11-02 19:50:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 19:50:40,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:40,651 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] [2022-11-02 19:50:40,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 19:50:40,651 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:40,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:40,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2135115312, now seen corresponding path program 1 times [2022-11-02 19:50:40,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:40,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588056052] [2022-11-02 19:50:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:40,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:40,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 19:50:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:40,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:40,959 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 19:50:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:40,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588056052] [2022-11-02 19:50:40,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588056052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:40,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:40,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-02 19:50:40,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063254378] [2022-11-02 19:50:40,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:40,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 19:50:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:40,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 19:50:40,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-11-02 19:50:40,962 INFO L87 Difference]: Start difference. First operand 607 states and 785 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:42,178 INFO L93 Difference]: Finished difference Result 636 states and 822 transitions. [2022-11-02 19:50:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 19:50:42,179 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-11-02 19:50:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:42,181 INFO L225 Difference]: With dead ends: 636 [2022-11-02 19:50:42,181 INFO L226 Difference]: Without dead ends: 616 [2022-11-02 19:50:42,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-11-02 19:50:42,182 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 325 mSDsluCounter, 3641 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 4060 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:42,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 4060 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 19:50:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-11-02 19:50:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2022-11-02 19:50:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 515 states have (on average 1.2854368932038835) internal successors, (662), 521 states have internal predecessors, (662), 52 states have call successors, (52), 27 states have call predecessors, (52), 36 states have return successors, (66), 55 states have call predecessors, (66), 48 states have call successors, (66) [2022-11-02 19:50:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 780 transitions. [2022-11-02 19:50:42,195 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 780 transitions. Word has length 55 [2022-11-02 19:50:42,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:42,196 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 780 transitions. [2022-11-02 19:50:42,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 780 transitions. [2022-11-02 19:50:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 19:50:42,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:42,198 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] [2022-11-02 19:50:42,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 19:50:42,199 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:42,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash -250939957, now seen corresponding path program 1 times [2022-11-02 19:50:42,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:42,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815512099] [2022-11-02 19:50:42,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:42,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:42,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 19:50:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:42,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:42,540 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 19:50:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:42,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815512099] [2022-11-02 19:50:42,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815512099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:42,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:42,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 19:50:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425397690] [2022-11-02 19:50:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:42,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:50:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:42,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:50:42,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:42,543 INFO L87 Difference]: Start difference. First operand 604 states and 780 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 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 19:50:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:43,464 INFO L93 Difference]: Finished difference Result 628 states and 811 transitions. [2022-11-02 19:50:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 19:50:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 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 54 [2022-11-02 19:50:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:43,467 INFO L225 Difference]: With dead ends: 628 [2022-11-02 19:50:43,467 INFO L226 Difference]: Without dead ends: 606 [2022-11-02 19:50:43,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 19:50:43,468 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 116 mSDsluCounter, 3123 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 3540 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:43,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 3540 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 19:50:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-02 19:50:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 594. [2022-11-02 19:50:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 507 states have (on average 1.2859960552268244) internal successors, (652), 513 states have internal predecessors, (652), 50 states have call successors, (50), 27 states have call predecessors, (50), 36 states have return successors, (64), 53 states have call predecessors, (64), 46 states have call successors, (64) [2022-11-02 19:50:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 766 transitions. [2022-11-02 19:50:43,480 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 766 transitions. Word has length 54 [2022-11-02 19:50:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:43,480 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 766 transitions. [2022-11-02 19:50:43,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 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 19:50:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 766 transitions. [2022-11-02 19:50:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 19:50:43,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:43,482 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] [2022-11-02 19:50:43,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 19:50:43,483 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:43,483 INFO L85 PathProgramCache]: Analyzing trace with hash 538585810, now seen corresponding path program 1 times [2022-11-02 19:50:43,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:43,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852765699] [2022-11-02 19:50:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:43,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 19:50:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 19:50:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:43,567 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 19:50:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:43,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852765699] [2022-11-02 19:50:43,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852765699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:43,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:43,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157908298] [2022-11-02 19:50:43,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:43,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:43,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:43,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:43,570 INFO L87 Difference]: Start difference. First operand 594 states and 766 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 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 19:50:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:43,950 INFO L93 Difference]: Finished difference Result 606 states and 783 transitions. [2022-11-02 19:50:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:43,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 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 54 [2022-11-02 19:50:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:43,952 INFO L225 Difference]: With dead ends: 606 [2022-11-02 19:50:43,952 INFO L226 Difference]: Without dead ends: 601 [2022-11-02 19:50:43,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:43,953 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 94 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:43,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1898 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-02 19:50:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 589. [2022-11-02 19:50:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 503 states have (on average 1.286282306163022) internal successors, (647), 509 states have internal predecessors, (647), 49 states have call successors, (49), 27 states have call predecessors, (49), 36 states have return successors, (63), 52 states have call predecessors, (63), 45 states have call successors, (63) [2022-11-02 19:50:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 759 transitions. [2022-11-02 19:50:43,965 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 759 transitions. Word has length 54 [2022-11-02 19:50:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:43,965 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 759 transitions. [2022-11-02 19:50:43,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 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 19:50:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 759 transitions. [2022-11-02 19:50:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 19:50:43,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:43,968 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] [2022-11-02 19:50:43,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 19:50:43,968 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1724995102, now seen corresponding path program 1 times [2022-11-02 19:50:43,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:43,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318195749] [2022-11-02 19:50:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:44,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 19:50:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 19:50:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:44,123 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 19:50:44,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:44,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318195749] [2022-11-02 19:50:44,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318195749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:44,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:44,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 19:50:44,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870451638] [2022-11-02 19:50:44,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:44,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 19:50:44,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:44,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 19:50:44,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:50:44,126 INFO L87 Difference]: Start difference. First operand 589 states and 759 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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 19:50:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:44,665 INFO L93 Difference]: Finished difference Result 621 states and 799 transitions. [2022-11-02 19:50:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:50:44,665 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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 54 [2022-11-02 19:50:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:44,667 INFO L225 Difference]: With dead ends: 621 [2022-11-02 19:50:44,667 INFO L226 Difference]: Without dead ends: 598 [2022-11-02 19:50:44,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-11-02 19:50:44,668 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 232 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:44,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3051 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:50:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-02 19:50:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 586. [2022-11-02 19:50:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 501 states have (on average 1.2854291417165669) internal successors, (644), 507 states have internal predecessors, (644), 48 states have call successors, (48), 27 states have call predecessors, (48), 36 states have return successors, (62), 51 states have call predecessors, (62), 44 states have call successors, (62) [2022-11-02 19:50:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 754 transitions. [2022-11-02 19:50:44,679 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 754 transitions. Word has length 54 [2022-11-02 19:50:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:44,679 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 754 transitions. [2022-11-02 19:50:44,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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 19:50:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 754 transitions. [2022-11-02 19:50:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 19:50:44,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:44,681 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] [2022-11-02 19:50:44,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 19:50:44,682 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash -726384384, now seen corresponding path program 1 times [2022-11-02 19:50:44,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:44,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394270910] [2022-11-02 19:50:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:44,784 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 19:50:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:44,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394270910] [2022-11-02 19:50:44,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394270910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:44,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:44,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:44,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429619614] [2022-11-02 19:50:44,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:44,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:44,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:44,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:44,786 INFO L87 Difference]: Start difference. First operand 586 states and 754 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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 19:50:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:45,454 INFO L93 Difference]: Finished difference Result 665 states and 860 transitions. [2022-11-02 19:50:45,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:50:45,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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 54 [2022-11-02 19:50:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:45,457 INFO L225 Difference]: With dead ends: 665 [2022-11-02 19:50:45,457 INFO L226 Difference]: Without dead ends: 665 [2022-11-02 19:50:45,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:50:45,458 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 689 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:45,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1438 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:50:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-11-02 19:50:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 584. [2022-11-02 19:50:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 499 states have (on average 1.2845691382765532) internal successors, (641), 505 states have internal predecessors, (641), 48 states have call successors, (48), 27 states have call predecessors, (48), 36 states have return successors, (62), 51 states have call predecessors, (62), 44 states have call successors, (62) [2022-11-02 19:50:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 751 transitions. [2022-11-02 19:50:45,470 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 751 transitions. Word has length 54 [2022-11-02 19:50:45,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:45,471 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 751 transitions. [2022-11-02 19:50:45,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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 19:50:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 751 transitions. [2022-11-02 19:50:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 19:50:45,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:45,473 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] [2022-11-02 19:50:45,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 19:50:45,473 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:45,474 INFO L85 PathProgramCache]: Analyzing trace with hash -726107554, now seen corresponding path program 1 times [2022-11-02 19:50:45,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:45,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644710708] [2022-11-02 19:50:45,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:45,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:45,688 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 19:50:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:45,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644710708] [2022-11-02 19:50:45,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644710708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:45,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:45,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 19:50:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828398789] [2022-11-02 19:50:45,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:45,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 19:50:45,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:45,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 19:50:45,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:50:45,692 INFO L87 Difference]: Start difference. First operand 584 states and 751 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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 19:50:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:46,619 INFO L93 Difference]: Finished difference Result 603 states and 775 transitions. [2022-11-02 19:50:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 19:50:46,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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 54 [2022-11-02 19:50:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:46,622 INFO L225 Difference]: With dead ends: 603 [2022-11-02 19:50:46,622 INFO L226 Difference]: Without dead ends: 558 [2022-11-02 19:50:46,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-11-02 19:50:46,623 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 211 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:46,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2701 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 19:50:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-02 19:50:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 542. [2022-11-02 19:50:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 459 states have (on average 1.2745098039215685) internal successors, (585), 465 states have internal predecessors, (585), 48 states have call successors, (48), 27 states have call predecessors, (48), 34 states have return successors, (60), 49 states have call predecessors, (60), 44 states have call successors, (60) [2022-11-02 19:50:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 693 transitions. [2022-11-02 19:50:46,633 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 693 transitions. Word has length 54 [2022-11-02 19:50:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:46,634 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 693 transitions. [2022-11-02 19:50:46,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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 19:50:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 693 transitions. [2022-11-02 19:50:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 19:50:46,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:46,636 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] [2022-11-02 19:50:46,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 19:50:46,636 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1795419470, now seen corresponding path program 1 times [2022-11-02 19:50:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:46,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244180640] [2022-11-02 19:50:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 19:50:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:46,726 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 19:50:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:46,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244180640] [2022-11-02 19:50:46,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244180640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:46,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:46,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:50:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429481647] [2022-11-02 19:50:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:46,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:50:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:50:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:46,729 INFO L87 Difference]: Start difference. First operand 542 states and 693 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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 19:50:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:47,272 INFO L93 Difference]: Finished difference Result 572 states and 730 transitions. [2022-11-02 19:50:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:50:47,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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 56 [2022-11-02 19:50:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:47,274 INFO L225 Difference]: With dead ends: 572 [2022-11-02 19:50:47,275 INFO L226 Difference]: Without dead ends: 572 [2022-11-02 19:50:47,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:50:47,275 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 177 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:47,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1976 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:50:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-11-02 19:50:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 542. [2022-11-02 19:50:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 459 states have (on average 1.2723311546840959) internal successors, (584), 465 states have internal predecessors, (584), 48 states have call successors, (48), 27 states have call predecessors, (48), 34 states have return successors, (60), 49 states have call predecessors, (60), 44 states have call successors, (60) [2022-11-02 19:50:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 692 transitions. [2022-11-02 19:50:47,286 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 692 transitions. Word has length 56 [2022-11-02 19:50:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:47,286 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 692 transitions. [2022-11-02 19:50:47,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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 19:50:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 692 transitions. [2022-11-02 19:50:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 19:50:47,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:47,288 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] [2022-11-02 19:50:47,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 19:50:47,288 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1818051724, now seen corresponding path program 1 times [2022-11-02 19:50:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:47,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210561735] [2022-11-02 19:50:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 19:50:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:47,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:47,523 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 19:50:47,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:47,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210561735] [2022-11-02 19:50:47,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210561735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:47,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:47,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 19:50:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127001561] [2022-11-02 19:50:47,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:47,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 19:50:47,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:47,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 19:50:47,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:50:47,525 INFO L87 Difference]: Start difference. First operand 542 states and 692 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:48,499 INFO L93 Difference]: Finished difference Result 594 states and 756 transitions. [2022-11-02 19:50:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 19:50:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-11-02 19:50:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:48,501 INFO L225 Difference]: With dead ends: 594 [2022-11-02 19:50:48,501 INFO L226 Difference]: Without dead ends: 567 [2022-11-02 19:50:48,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:50:48,502 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 249 mSDsluCounter, 3012 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 3415 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:48,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 3415 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 19:50:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-02 19:50:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 537. [2022-11-02 19:50:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 455 states have (on average 1.268131868131868) internal successors, (577), 461 states have internal predecessors, (577), 47 states have call successors, (47), 27 states have call predecessors, (47), 34 states have return successors, (58), 48 states have call predecessors, (58), 43 states have call successors, (58) [2022-11-02 19:50:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 682 transitions. [2022-11-02 19:50:48,511 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 682 transitions. Word has length 56 [2022-11-02 19:50:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:48,512 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 682 transitions. [2022-11-02 19:50:48,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 682 transitions. [2022-11-02 19:50:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 19:50:48,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:48,513 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] [2022-11-02 19:50:48,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 19:50:48,513 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash -356987344, now seen corresponding path program 1 times [2022-11-02 19:50:48,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:48,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190954261] [2022-11-02 19:50:48,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:48,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:48,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 19:50:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:48,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:48,607 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 19:50:48,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:48,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190954261] [2022-11-02 19:50:48,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190954261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:48,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:48,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:50:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265679025] [2022-11-02 19:50:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:48,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:50:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:50:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:48,609 INFO L87 Difference]: Start difference. First operand 537 states and 682 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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 19:50:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:49,111 INFO L93 Difference]: Finished difference Result 549 states and 699 transitions. [2022-11-02 19:50:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:50:49,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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 56 [2022-11-02 19:50:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:49,113 INFO L225 Difference]: With dead ends: 549 [2022-11-02 19:50:49,113 INFO L226 Difference]: Without dead ends: 543 [2022-11-02 19:50:49,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:50:49,114 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 159 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:49,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1829 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:50:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-02 19:50:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2022-11-02 19:50:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 450 states have (on average 1.268888888888889) internal successors, (571), 456 states have internal predecessors, (571), 46 states have call successors, (46), 27 states have call predecessors, (46), 34 states have return successors, (57), 47 states have call predecessors, (57), 42 states have call successors, (57) [2022-11-02 19:50:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 674 transitions. [2022-11-02 19:50:49,123 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 674 transitions. Word has length 56 [2022-11-02 19:50:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:49,124 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 674 transitions. [2022-11-02 19:50:49,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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 19:50:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 674 transitions. [2022-11-02 19:50:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 19:50:49,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:49,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:49,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 19:50:49,126 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1208974705, now seen corresponding path program 1 times [2022-11-02 19:50:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:49,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130764015] [2022-11-02 19:50:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:49,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 19:50:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:50:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:49,219 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 19:50:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:49,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130764015] [2022-11-02 19:50:49,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130764015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:49,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:49,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:50:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282055080] [2022-11-02 19:50:49,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:49,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:50:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:50:49,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:49,221 INFO L87 Difference]: Start difference. First operand 531 states and 674 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 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 19:50:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:49,620 INFO L93 Difference]: Finished difference Result 542 states and 689 transitions. [2022-11-02 19:50:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:50:49,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 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 58 [2022-11-02 19:50:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:49,622 INFO L225 Difference]: With dead ends: 542 [2022-11-02 19:50:49,622 INFO L226 Difference]: Without dead ends: 531 [2022-11-02 19:50:49,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:50:49,623 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 176 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:49,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1580 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-11-02 19:50:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 519. [2022-11-02 19:50:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 439 states have (on average 1.2642369020501139) internal successors, (555), 445 states have internal predecessors, (555), 45 states have call successors, (45), 27 states have call predecessors, (45), 34 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2022-11-02 19:50:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 656 transitions. [2022-11-02 19:50:49,632 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 656 transitions. Word has length 58 [2022-11-02 19:50:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:49,633 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 656 transitions. [2022-11-02 19:50:49,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 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 19:50:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 656 transitions. [2022-11-02 19:50:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 19:50:49,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:49,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:49,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 19:50:49,635 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1375988349, now seen corresponding path program 1 times [2022-11-02 19:50:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:49,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578753132] [2022-11-02 19:50:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:49,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:49,852 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 19:50:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:49,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578753132] [2022-11-02 19:50:49,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578753132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:49,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:49,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 19:50:49,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044736944] [2022-11-02 19:50:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:49,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 19:50:49,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:49,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 19:50:49,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:50:49,855 INFO L87 Difference]: Start difference. First operand 519 states and 656 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:51,621 INFO L93 Difference]: Finished difference Result 969 states and 1231 transitions. [2022-11-02 19:50:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 19:50:51,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-11-02 19:50:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:51,624 INFO L225 Difference]: With dead ends: 969 [2022-11-02 19:50:51,624 INFO L226 Difference]: Without dead ends: 940 [2022-11-02 19:50:51,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2022-11-02 19:50:51,625 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 713 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:51,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 2522 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 19:50:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-11-02 19:50:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 716. [2022-11-02 19:50:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 601 states have (on average 1.276206322795341) internal successors, (767), 614 states have internal predecessors, (767), 63 states have call successors, (63), 40 states have call predecessors, (63), 51 states have return successors, (82), 61 states have call predecessors, (82), 59 states have call successors, (82) [2022-11-02 19:50:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 912 transitions. [2022-11-02 19:50:51,642 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 912 transitions. Word has length 58 [2022-11-02 19:50:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:51,642 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 912 transitions. [2022-11-02 19:50:51,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 912 transitions. [2022-11-02 19:50:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 19:50:51,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:51,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:51,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 19:50:51,645 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2042959941, now seen corresponding path program 1 times [2022-11-02 19:50:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:51,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101864998] [2022-11-02 19:50:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:51,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:51,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:51,748 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 19:50:51,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:51,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101864998] [2022-11-02 19:50:51,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101864998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:51,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:51,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:51,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979183217] [2022-11-02 19:50:51,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:51,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:51,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:51,751 INFO L87 Difference]: Start difference. First operand 716 states and 912 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:52,687 INFO L93 Difference]: Finished difference Result 957 states and 1218 transitions. [2022-11-02 19:50:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 19:50:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-11-02 19:50:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:52,691 INFO L225 Difference]: With dead ends: 957 [2022-11-02 19:50:52,691 INFO L226 Difference]: Without dead ends: 957 [2022-11-02 19:50:52,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:50:52,692 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 878 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:52,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2167 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 19:50:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-11-02 19:50:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 532. [2022-11-02 19:50:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 451 states have (on average 1.2594235033259424) internal successors, (568), 456 states have internal predecessors, (568), 45 states have call successors, (45), 29 states have call predecessors, (45), 35 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2022-11-02 19:50:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 669 transitions. [2022-11-02 19:50:52,708 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 669 transitions. Word has length 58 [2022-11-02 19:50:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:52,708 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 669 transitions. [2022-11-02 19:50:52,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 669 transitions. [2022-11-02 19:50:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 19:50:52,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:52,711 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 19:50:52,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 19:50:52,711 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2107046685, now seen corresponding path program 1 times [2022-11-02 19:50:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:52,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310646662] [2022-11-02 19:50:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:52,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:52,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:50:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:52,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 19:50:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:53,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:53,023 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 19:50:53,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310646662] [2022-11-02 19:50:53,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310646662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:53,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:53,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 19:50:53,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548956657] [2022-11-02 19:50:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:53,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 19:50:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:53,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 19:50:53,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:50:53,026 INFO L87 Difference]: Start difference. First operand 532 states and 669 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 19:50:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:54,059 INFO L93 Difference]: Finished difference Result 561 states and 705 transitions. [2022-11-02 19:50:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 19:50:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2022-11-02 19:50:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:54,062 INFO L225 Difference]: With dead ends: 561 [2022-11-02 19:50:54,062 INFO L226 Difference]: Without dead ends: 542 [2022-11-02 19:50:54,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:50:54,063 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 220 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:54,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 2905 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 19:50:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-11-02 19:50:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 530. [2022-11-02 19:50:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 449 states have (on average 1.2583518930957684) internal successors, (565), 454 states have internal predecessors, (565), 45 states have call successors, (45), 29 states have call predecessors, (45), 35 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2022-11-02 19:50:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 666 transitions. [2022-11-02 19:50:54,073 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 666 transitions. Word has length 62 [2022-11-02 19:50:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:54,073 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 666 transitions. [2022-11-02 19:50:54,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 19:50:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 666 transitions. [2022-11-02 19:50:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 19:50:54,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:54,075 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 19:50:54,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 19:50:54,076 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash -790506152, now seen corresponding path program 1 times [2022-11-02 19:50:54,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:54,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105755951] [2022-11-02 19:50:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:50:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:50:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,199 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 19:50:54,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:54,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105755951] [2022-11-02 19:50:54,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105755951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:54,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:54,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:50:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573275929] [2022-11-02 19:50:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:54,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:50:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:54,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:50:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:54,202 INFO L87 Difference]: Start difference. First operand 530 states and 666 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 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 19:50:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:54,628 INFO L93 Difference]: Finished difference Result 534 states and 670 transitions. [2022-11-02 19:50:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:50:54,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 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 63 [2022-11-02 19:50:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:54,630 INFO L225 Difference]: With dead ends: 534 [2022-11-02 19:50:54,630 INFO L226 Difference]: Without dead ends: 525 [2022-11-02 19:50:54,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:50:54,631 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 236 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:54,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1235 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-11-02 19:50:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 513. [2022-11-02 19:50:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 435 states have (on average 1.2551724137931035) internal successors, (546), 440 states have internal predecessors, (546), 42 states have call successors, (42), 29 states have call predecessors, (42), 35 states have return successors, (52), 43 states have call predecessors, (52), 38 states have call successors, (52) [2022-11-02 19:50:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 640 transitions. [2022-11-02 19:50:54,639 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 640 transitions. Word has length 63 [2022-11-02 19:50:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:54,639 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 640 transitions. [2022-11-02 19:50:54,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 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 19:50:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 640 transitions. [2022-11-02 19:50:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 19:50:54,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:54,641 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] [2022-11-02 19:50:54,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 19:50:54,642 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:54,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:54,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1970957845, now seen corresponding path program 1 times [2022-11-02 19:50:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:54,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178837255] [2022-11-02 19:50:54,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:54,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 19:50:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 19:50:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:54,913 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 19:50:54,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:54,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178837255] [2022-11-02 19:50:54,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178837255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:54,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:54,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 19:50:54,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210478489] [2022-11-02 19:50:54,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:54,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 19:50:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:54,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 19:50:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:50:54,916 INFO L87 Difference]: Start difference. First operand 513 states and 640 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 19:50:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:55,860 INFO L93 Difference]: Finished difference Result 539 states and 671 transitions. [2022-11-02 19:50:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 19:50:55,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2022-11-02 19:50:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:55,862 INFO L225 Difference]: With dead ends: 539 [2022-11-02 19:50:55,862 INFO L226 Difference]: Without dead ends: 504 [2022-11-02 19:50:55,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:50:55,863 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 298 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:55,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 2524 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 19:50:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-11-02 19:50:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 492. [2022-11-02 19:50:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 419 states have (on average 1.2553699284009547) internal successors, (526), 424 states have internal predecessors, (526), 38 states have call successors, (38), 28 states have call predecessors, (38), 34 states have return successors, (47), 39 states have call predecessors, (47), 34 states have call successors, (47) [2022-11-02 19:50:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 611 transitions. [2022-11-02 19:50:55,873 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 611 transitions. Word has length 60 [2022-11-02 19:50:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:55,873 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 611 transitions. [2022-11-02 19:50:55,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 19:50:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 611 transitions. [2022-11-02 19:50:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 19:50:55,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:55,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:50:55,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 19:50:55,876 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash 789888525, now seen corresponding path program 1 times [2022-11-02 19:50:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:55,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998910251] [2022-11-02 19:50:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:55,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 19:50:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:55,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 19:50:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:55,963 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 19:50:55,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:55,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998910251] [2022-11-02 19:50:55,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998910251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:55,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:55,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:55,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957567384] [2022-11-02 19:50:55,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:55,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:55,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:55,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:55,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:55,965 INFO L87 Difference]: Start difference. First operand 492 states and 611 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 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 19:50:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:56,264 INFO L93 Difference]: Finished difference Result 502 states and 623 transitions. [2022-11-02 19:50:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:56,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 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 58 [2022-11-02 19:50:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:56,266 INFO L225 Difference]: With dead ends: 502 [2022-11-02 19:50:56,266 INFO L226 Difference]: Without dead ends: 496 [2022-11-02 19:50:56,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:56,266 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 148 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:56,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1228 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:50:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-11-02 19:50:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 484. [2022-11-02 19:50:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 412 states have (on average 1.2548543689320388) internal successors, (517), 417 states have internal predecessors, (517), 37 states have call successors, (37), 28 states have call predecessors, (37), 34 states have return successors, (45), 38 states have call predecessors, (45), 33 states have call successors, (45) [2022-11-02 19:50:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 599 transitions. [2022-11-02 19:50:56,275 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 599 transitions. Word has length 58 [2022-11-02 19:50:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:56,275 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 599 transitions. [2022-11-02 19:50:56,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 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 19:50:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 599 transitions. [2022-11-02 19:50:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 19:50:56,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:56,277 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 19:50:56,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 19:50:56,278 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2051318318, now seen corresponding path program 1 times [2022-11-02 19:50:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:56,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116355113] [2022-11-02 19:50:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:50:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:56,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 19:50:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:56,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 19:50:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 19:50:56,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:56,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116355113] [2022-11-02 19:50:56,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116355113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:56,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:56,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:50:56,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59987108] [2022-11-02 19:50:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:56,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 19:50:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 19:50:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:56,377 INFO L87 Difference]: Start difference. First operand 484 states and 599 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 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 19:50:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:56,619 INFO L93 Difference]: Finished difference Result 496 states and 614 transitions. [2022-11-02 19:50:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:50:56,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 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 60 [2022-11-02 19:50:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:56,621 INFO L225 Difference]: With dead ends: 496 [2022-11-02 19:50:56,621 INFO L226 Difference]: Without dead ends: 486 [2022-11-02 19:50:56,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:50:56,621 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 88 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:56,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1345 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:50:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-11-02 19:50:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 474. [2022-11-02 19:50:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 404 states have (on average 1.254950495049505) internal successors, (507), 409 states have internal predecessors, (507), 35 states have call successors, (35), 28 states have call predecessors, (35), 34 states have return successors, (43), 36 states have call predecessors, (43), 31 states have call successors, (43) [2022-11-02 19:50:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 585 transitions. [2022-11-02 19:50:56,629 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 585 transitions. Word has length 60 [2022-11-02 19:50:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:56,629 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 585 transitions. [2022-11-02 19:50:56,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 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 19:50:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 585 transitions. [2022-11-02 19:50:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 19:50:56,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:56,631 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] [2022-11-02 19:50:56,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-02 19:50:56,631 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:56,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1819248512, now seen corresponding path program 1 times [2022-11-02 19:50:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:56,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486036663] [2022-11-02 19:50:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:56,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 19:50:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:56,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 19:50:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:56,828 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 19:50:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:56,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486036663] [2022-11-02 19:50:56,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486036663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:56,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:56,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 19:50:56,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460817905] [2022-11-02 19:50:56,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:56,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:50:56,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:56,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:50:56,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:56,830 INFO L87 Difference]: Start difference. First operand 474 states and 585 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:57,940 INFO L93 Difference]: Finished difference Result 765 states and 956 transitions. [2022-11-02 19:50:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 19:50:57,941 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2022-11-02 19:50:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:57,943 INFO L225 Difference]: With dead ends: 765 [2022-11-02 19:50:57,943 INFO L226 Difference]: Without dead ends: 732 [2022-11-02 19:50:57,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-11-02 19:50:57,943 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 455 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 3000 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:57,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 3000 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 19:50:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-11-02 19:50:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 368. [2022-11-02 19:50:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 310 states have (on average 1.270967741935484) internal successors, (394), 314 states have internal predecessors, (394), 30 states have call successors, (30), 24 states have call predecessors, (30), 27 states have return successors, (36), 29 states have call predecessors, (36), 27 states have call successors, (36) [2022-11-02 19:50:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-11-02 19:50:57,951 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 60 [2022-11-02 19:50:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:57,951 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-11-02 19:50:57,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 19:50:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-11-02 19:50:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 19:50:57,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:57,953 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 19:50:57,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-02 19:50:57,953 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1463057072, now seen corresponding path program 1 times [2022-11-02 19:50:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:57,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44362996] [2022-11-02 19:50:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:57,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:50:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:50:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:50:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:50:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 19:50:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,209 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 19:50:58,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:58,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44362996] [2022-11-02 19:50:58,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44362996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:58,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:58,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 19:50:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933642544] [2022-11-02 19:50:58,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:58,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:50:58,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:58,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:50:58,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:50:58,211 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 19:50:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:58,659 INFO L93 Difference]: Finished difference Result 373 states and 465 transitions. [2022-11-02 19:50:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 19:50:58,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2022-11-02 19:50:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:58,661 INFO L225 Difference]: With dead ends: 373 [2022-11-02 19:50:58,661 INFO L226 Difference]: Without dead ends: 373 [2022-11-02 19:50:58,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:50:58,661 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 222 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:58,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1335 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:50:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-02 19:50:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 361. [2022-11-02 19:50:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 303 states have (on average 1.2640264026402641) internal successors, (383), 307 states have internal predecessors, (383), 30 states have call successors, (30), 24 states have call predecessors, (30), 27 states have return successors, (36), 29 states have call predecessors, (36), 27 states have call successors, (36) [2022-11-02 19:50:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 449 transitions. [2022-11-02 19:50:58,667 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 449 transitions. Word has length 64 [2022-11-02 19:50:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:58,667 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 449 transitions. [2022-11-02 19:50:58,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 19:50:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 449 transitions. [2022-11-02 19:50:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 19:50:58,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:58,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:58,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-02 19:50:58,668 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:58,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:58,669 INFO L85 PathProgramCache]: Analyzing trace with hash 659665596, now seen corresponding path program 1 times [2022-11-02 19:50:58,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:58,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226666458] [2022-11-02 19:50:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:58,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 19:50:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 19:50:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 19:50:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 19:50:58,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:58,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226666458] [2022-11-02 19:50:58,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226666458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:50:58,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883288194] [2022-11-02 19:50:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:58,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:50:58,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:50:58,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:50:58,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 19:50:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:58,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 19:50:58,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:50:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:50:59,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:50:59,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883288194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:59,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:50:59,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-02 19:50:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653596383] [2022-11-02 19:50:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:59,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:50:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:50:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:59,081 INFO L87 Difference]: Start difference. First operand 361 states and 449 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 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 19:50:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:50:59,094 INFO L93 Difference]: Finished difference Result 346 states and 431 transitions. [2022-11-02 19:50:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:50:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 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 62 [2022-11-02 19:50:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:50:59,095 INFO L225 Difference]: With dead ends: 346 [2022-11-02 19:50:59,095 INFO L226 Difference]: Without dead ends: 332 [2022-11-02 19:50:59,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:50:59,096 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:50:59,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 917 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:50:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-11-02 19:50:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-11-02 19:50:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 280 states have (on average 1.275) internal successors, (357), 283 states have internal predecessors, (357), 27 states have call successors, (27), 22 states have call predecessors, (27), 24 states have return successors, (32), 26 states have call predecessors, (32), 24 states have call successors, (32) [2022-11-02 19:50:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 416 transitions. [2022-11-02 19:50:59,102 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 416 transitions. Word has length 62 [2022-11-02 19:50:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:50:59,102 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 416 transitions. [2022-11-02 19:50:59,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 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 19:50:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 416 transitions. [2022-11-02 19:50:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 19:50:59,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:50:59,104 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 19:50:59,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 19:50:59,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-11-02 19:50:59,326 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:50:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:50:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash -747836141, now seen corresponding path program 1 times [2022-11-02 19:50:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:50:59,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736331122] [2022-11-02 19:50:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:50:59,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:50:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 19:50:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 19:50:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 19:50:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:50:59,641 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 19:50:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:50:59,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736331122] [2022-11-02 19:50:59,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736331122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:50:59,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:50:59,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 19:50:59,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421242052] [2022-11-02 19:50:59,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:50:59,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 19:50:59,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:50:59,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 19:50:59,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-02 19:50:59,644 INFO L87 Difference]: Start difference. First operand 332 states and 416 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 19:51:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:00,361 INFO L93 Difference]: Finished difference Result 343 states and 430 transitions. [2022-11-02 19:51:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 19:51:00,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-02 19:51:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:00,363 INFO L225 Difference]: With dead ends: 343 [2022-11-02 19:51:00,363 INFO L226 Difference]: Without dead ends: 270 [2022-11-02 19:51:00,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-02 19:51:00,363 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 154 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:00,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1699 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 19:51:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-02 19:51:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2022-11-02 19:51:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.3) internal successors, (286), 222 states have internal predecessors, (286), 22 states have call successors, (22), 19 states have call predecessors, (22), 21 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2022-11-02 19:51:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 336 transitions. [2022-11-02 19:51:00,368 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 336 transitions. Word has length 64 [2022-11-02 19:51:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:00,369 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 336 transitions. [2022-11-02 19:51:00,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 19:51:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 336 transitions. [2022-11-02 19:51:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 19:51:00,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:00,370 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 19:51:00,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-02 19:51:00,371 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:51:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:00,371 INFO L85 PathProgramCache]: Analyzing trace with hash 611039127, now seen corresponding path program 1 times [2022-11-02 19:51:00,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:00,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828067999] [2022-11-02 19:51:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:00,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:51:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:00,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:00,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:51:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:00,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:51:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 19:51:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:00,568 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 19:51:00,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:51:00,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828067999] [2022-11-02 19:51:00,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828067999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:51:00,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:51:00,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 19:51:00,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740168747] [2022-11-02 19:51:00,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:51:00,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 19:51:00,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:51:00,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 19:51:00,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:51:00,570 INFO L87 Difference]: Start difference. First operand 264 states and 336 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 19:51:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:00,931 INFO L93 Difference]: Finished difference Result 270 states and 342 transitions. [2022-11-02 19:51:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:51:00,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2022-11-02 19:51:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:00,932 INFO L225 Difference]: With dead ends: 270 [2022-11-02 19:51:00,933 INFO L226 Difference]: Without dead ends: 270 [2022-11-02 19:51:00,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-11-02 19:51:00,933 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 244 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:00,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 711 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:51:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-02 19:51:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2022-11-02 19:51:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.2954545454545454) internal successors, (285), 222 states have internal predecessors, (285), 22 states have call successors, (22), 19 states have call predecessors, (22), 21 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2022-11-02 19:51:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 335 transitions. [2022-11-02 19:51:00,937 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 335 transitions. Word has length 68 [2022-11-02 19:51:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:00,937 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 335 transitions. [2022-11-02 19:51:00,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 19:51:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 335 transitions. [2022-11-02 19:51:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 19:51:00,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:00,938 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] [2022-11-02 19:51:00,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-02 19:51:00,939 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:51:00,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:00,939 INFO L85 PathProgramCache]: Analyzing trace with hash -993138030, now seen corresponding path program 1 times [2022-11-02 19:51:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:00,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337766717] [2022-11-02 19:51:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:51:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:51:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:51:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:51:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,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 19:51:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:51:01,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337766717] [2022-11-02 19:51:01,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337766717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:51:01,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:51:01,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:51:01,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396114885] [2022-11-02 19:51:01,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:51:01,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:51:01,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:51:01,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:51:01,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:51:01,124 INFO L87 Difference]: Start difference. First operand 264 states and 335 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 19:51:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:01,406 INFO L93 Difference]: Finished difference Result 216 states and 264 transitions. [2022-11-02 19:51:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:51:01,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-11-02 19:51:01,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:01,407 INFO L225 Difference]: With dead ends: 216 [2022-11-02 19:51:01,407 INFO L226 Difference]: Without dead ends: 216 [2022-11-02 19:51:01,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-02 19:51:01,408 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 47 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:01,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 745 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:51:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-02 19:51:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 175. [2022-11-02 19:51:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 146 states have internal predecessors, (179), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-02 19:51:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2022-11-02 19:51:01,411 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 70 [2022-11-02 19:51:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:01,411 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2022-11-02 19:51:01,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 19:51:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2022-11-02 19:51:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-02 19:51:01,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:01,413 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, 1, 1, 1, 1] [2022-11-02 19:51:01,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-02 19:51:01,413 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:51:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash -365687255, now seen corresponding path program 1 times [2022-11-02 19:51:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:01,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503632564] [2022-11-02 19:51:01,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:51:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:51:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:51:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:51:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 19:51:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:01,565 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 19:51:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:51:01,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503632564] [2022-11-02 19:51:01,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503632564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:51:01,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:51:01,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 19:51:01,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447899135] [2022-11-02 19:51:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:51:01,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 19:51:01,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:51:01,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 19:51:01,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:51:01,567 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 19:51:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:01,917 INFO L93 Difference]: Finished difference Result 221 states and 263 transitions. [2022-11-02 19:51:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 19:51:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2022-11-02 19:51:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:01,918 INFO L225 Difference]: With dead ends: 221 [2022-11-02 19:51:01,918 INFO L226 Difference]: Without dead ends: 185 [2022-11-02 19:51:01,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-02 19:51:01,919 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 198 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:01,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 893 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:51:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-02 19:51:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2022-11-02 19:51:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 143 states have (on average 1.2027972027972027) internal successors, (172), 144 states have internal predecessors, (172), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-02 19:51:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2022-11-02 19:51:01,922 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 84 [2022-11-02 19:51:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:01,922 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2022-11-02 19:51:01,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 19:51:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2022-11-02 19:51:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 19:51:01,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:01,923 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, 1, 1, 1, 1, 1, 1] [2022-11-02 19:51:01,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-02 19:51:01,924 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:51:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1430253116, now seen corresponding path program 1 times [2022-11-02 19:51:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:01,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057155408] [2022-11-02 19:51:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 19:51:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:51:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:51:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:51:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 19:51:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,097 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 19:51:02,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:51:02,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057155408] [2022-11-02 19:51:02,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057155408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:51:02,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:51:02,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 19:51:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188148870] [2022-11-02 19:51:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:51:02,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 19:51:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:51:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 19:51:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:51:02,099 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 19:51:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:02,371 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-11-02 19:51:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:51:02,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2022-11-02 19:51:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:02,372 INFO L225 Difference]: With dead ends: 198 [2022-11-02 19:51:02,372 INFO L226 Difference]: Without dead ends: 153 [2022-11-02 19:51:02,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-02 19:51:02,373 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 111 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:02,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 883 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:51:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-02 19:51:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2022-11-02 19:51:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 117 states have internal predecessors, (135), 12 states have call successors, (12), 11 states have call predecessors, (12), 12 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-02 19:51:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2022-11-02 19:51:02,375 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 86 [2022-11-02 19:51:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:02,376 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2022-11-02 19:51:02,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 19:51:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-11-02 19:51:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 19:51:02,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:02,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:51:02,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-11-02 19:51:02,377 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:51:02,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash -336818959, now seen corresponding path program 1 times [2022-11-02 19:51:02,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:02,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361374104] [2022-11-02 19:51:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:51:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 19:51:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:51:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:51:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:51:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 19:51:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 19:51:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 19:51:02,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:51:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361374104] [2022-11-02 19:51:02,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361374104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:51:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780498521] [2022-11-02 19:51:02,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:02,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:51:02,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:51:02,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:51:02,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 19:51:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:02,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 19:51:02,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:51:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 19:51:02,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:51:02,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780498521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:51:02,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:51:02,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 19:51:02,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096858891] [2022-11-02 19:51:02,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:51:02,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:51:02,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:51:02,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:51:02,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:51:02,810 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 19:51:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:02,821 INFO L93 Difference]: Finished difference Result 170 states and 195 transitions. [2022-11-02 19:51:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:51:02,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2022-11-02 19:51:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:02,822 INFO L225 Difference]: With dead ends: 170 [2022-11-02 19:51:02,822 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 19:51:02,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:51:02,823 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 16 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:02,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 236 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:51:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 19:51:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2022-11-02 19:51:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.152) internal successors, (144), 125 states have internal predecessors, (144), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-02 19:51:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2022-11-02 19:51:02,827 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 103 [2022-11-02 19:51:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:02,828 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2022-11-02 19:51:02,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 19:51:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2022-11-02 19:51:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 19:51:02,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:02,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:51:02,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 19:51:03,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:51:03,047 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:51:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1586409075, now seen corresponding path program 1 times [2022-11-02 19:51:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:03,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736875015] [2022-11-02 19:51:03,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:03,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:51:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 19:51:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:51:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:51:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:51:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 19:51:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 19:51:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 19:51:03,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:51:03,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736875015] [2022-11-02 19:51:03,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736875015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:51:03,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530562743] [2022-11-02 19:51:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:03,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:51:03,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:51:03,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:51:03,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 19:51:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 19:51:03,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:51:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 19:51:03,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:51:03,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530562743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:51:03,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:51:03,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-11-02 19:51:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968829221] [2022-11-02 19:51:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:51:03,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:51:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:51:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:51:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-02 19:51:03,535 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 19:51:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:03,669 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2022-11-02 19:51:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:51:03,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2022-11-02 19:51:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:03,670 INFO L225 Difference]: With dead ends: 151 [2022-11-02 19:51:03,670 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 19:51:03,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:51:03,670 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 144 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:03,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 214 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:51:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 19:51:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-02 19:51:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.136) internal successors, (142), 125 states have internal predecessors, (142), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-02 19:51:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2022-11-02 19:51:03,674 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 103 [2022-11-02 19:51:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:03,675 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2022-11-02 19:51:03,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 19:51:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2022-11-02 19:51:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 19:51:03,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:03,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:51:03,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 19:51:03,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:51:03,896 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:51:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash -354735347, now seen corresponding path program 1 times [2022-11-02 19:51:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:03,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614831892] [2022-11-02 19:51:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:51:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 19:51:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:51:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:51:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:51:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:51:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 19:51:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:51:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:51:04,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614831892] [2022-11-02 19:51:04,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614831892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:51:04,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:51:04,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:51:04,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088859247] [2022-11-02 19:51:04,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:51:04,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:51:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:51:04,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:51:04,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:51:04,051 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 19:51:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:04,205 INFO L93 Difference]: Finished difference Result 170 states and 189 transitions. [2022-11-02 19:51:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:51:04,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-11-02 19:51:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:04,207 INFO L225 Difference]: With dead ends: 170 [2022-11-02 19:51:04,207 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 19:51:04,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:51:04,208 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 74 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:04,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 356 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:51:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 19:51:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2022-11-02 19:51:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.104) internal successors, (138), 125 states have internal predecessors, (138), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-02 19:51:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2022-11-02 19:51:04,212 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 104 [2022-11-02 19:51:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:04,212 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2022-11-02 19:51:04,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 19:51:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2022-11-02 19:51:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 19:51:04,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:04,214 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:51:04,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-11-02 19:51:04,214 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:51:04,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 631465488, now seen corresponding path program 1 times [2022-11-02 19:51:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:04,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220219039] [2022-11-02 19:51:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:51:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 19:51:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:51:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:51:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:51:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:51:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 19:51:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:51:04,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:51:04,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220219039] [2022-11-02 19:51:04,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220219039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:51:04,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:51:04,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 19:51:04,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84451165] [2022-11-02 19:51:04,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:51:04,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:51:04,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:51:04,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:51:04,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:51:04,435 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 19:51:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:04,952 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2022-11-02 19:51:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 19:51:04,952 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-11-02 19:51:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:04,953 INFO L225 Difference]: With dead ends: 259 [2022-11-02 19:51:04,953 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 19:51:04,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-11-02 19:51:04,954 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 129 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:04,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 731 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:51:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 19:51:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-02 19:51:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.096) internal successors, (137), 125 states have internal predecessors, (137), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-02 19:51:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-11-02 19:51:04,957 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 104 [2022-11-02 19:51:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:04,957 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-11-02 19:51:04,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 19:51:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-11-02 19:51:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 19:51:04,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:51:04,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:51:04,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-11-02 19:51:04,959 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-02 19:51:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:51:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1766005042, now seen corresponding path program 1 times [2022-11-02 19:51:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:51:04,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990097967] [2022-11-02 19:51:04,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:51:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:51:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 19:51:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 19:51:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 19:51:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 19:51:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 19:51:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 19:51:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 19:51:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 19:51:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:51:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 19:51:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:51:05,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990097967] [2022-11-02 19:51:05,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990097967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:51:05,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:51:05,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 19:51:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523707590] [2022-11-02 19:51:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:51:05,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 19:51:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:51:05,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 19:51:05,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:51:05,256 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 19:51:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:51:05,646 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-11-02 19:51:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 19:51:05,647 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-11-02 19:51:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:51:05,647 INFO L225 Difference]: With dead ends: 148 [2022-11-02 19:51:05,647 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 19:51:05,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-11-02 19:51:05,648 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 190 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:51:05,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 551 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:51:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 19:51:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 19:51:05,649 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 19:51:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 19:51:05,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2022-11-02 19:51:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:51:05,650 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 19:51:05,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 19:51:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 19:51:05,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 19:51:05,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-11-02 19:51:05,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-11-02 19:51:05,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-11-02 19:51:05,658 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, 1, 1, 1, 1, 1, 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 19:51:05,660 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 19:51:05,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:51:05 BoogieIcfgContainer [2022-11-02 19:51:05,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 19:51:05,663 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 19:51:05,663 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 19:51:05,664 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 19:51:05,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:50:05" (3/4) ... [2022-11-02 19:51:05,667 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 19:51:05,675 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2022-11-02 19:51:05,675 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2022-11-02 19:51:05,675 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2022-11-02 19:51:05,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2022-11-02 19:51:05,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-11-02 19:51:05,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-11-02 19:51:05,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2022-11-02 19:51:05,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2022-11-02 19:51:05,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2022-11-02 19:51:05,676 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2022-11-02 19:51:05,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2022-11-02 19:51:05,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2022-11-02 19:51:05,677 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2022-11-02 19:51:05,703 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2022-11-02 19:51:05,705 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-11-02 19:51:05,708 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 19:51:05,711 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 19:51:05,890 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 19:51:05,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 19:51:05,891 INFO L158 Benchmark]: Toolchain (without parser) took 62870.57ms. Allocated memory was 109.1MB in the beginning and 339.7MB in the end (delta: 230.7MB). Free memory was 77.9MB in the beginning and 244.8MB in the end (delta: -166.8MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2022-11-02 19:51:05,891 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:51:05,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 779.03ms. Allocated memory was 109.1MB in the beginning and 155.2MB in the end (delta: 46.1MB). Free memory was 77.7MB in the beginning and 110.1MB in the end (delta: -32.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-02 19:51:05,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 159.88ms. Allocated memory is still 155.2MB. Free memory was 110.1MB in the beginning and 103.0MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 19:51:05,892 INFO L158 Benchmark]: Boogie Preprocessor took 130.32ms. Allocated memory is still 155.2MB. Free memory was 103.0MB in the beginning and 98.1MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 19:51:05,892 INFO L158 Benchmark]: RCFGBuilder took 1620.15ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 119.3MB in the end (delta: -21.2MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2022-11-02 19:51:05,892 INFO L158 Benchmark]: TraceAbstraction took 59947.08ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 118.3MB in the beginning and 268.9MB in the end (delta: -150.6MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2022-11-02 19:51:05,893 INFO L158 Benchmark]: Witness Printer took 226.85ms. Allocated memory is still 339.7MB. Free memory was 268.9MB in the beginning and 244.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-02 19:51:05,894 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.29ms. Allocated memory is still 109.1MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 779.03ms. Allocated memory was 109.1MB in the beginning and 155.2MB in the end (delta: 46.1MB). Free memory was 77.7MB in the beginning and 110.1MB in the end (delta: -32.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 159.88ms. Allocated memory is still 155.2MB. Free memory was 110.1MB in the beginning and 103.0MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.32ms. Allocated memory is still 155.2MB. Free memory was 103.0MB in the beginning and 98.1MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1620.15ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 119.3MB in the end (delta: -21.2MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * TraceAbstraction took 59947.08ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 118.3MB in the beginning and 268.9MB in the end (delta: -150.6MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * Witness Printer took 226.85ms. Allocated memory is still 339.7MB. Free memory was 268.9MB in the beginning and 244.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. 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: 59]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1717]: 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 14 procedures, 469 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 59.9s, OverallIterations: 77, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 43.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22242 SdHoareTripleChecker+Valid, 37.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21763 mSDsluCounter, 168292 SdHoareTripleChecker+Invalid, 31.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131039 mSDsCounter, 5731 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45434 IncrementalHoareTripleChecker+Invalid, 51165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5731 mSolverCounterUnsat, 37253 mSDtfsCounter, 45434 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1468 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 779 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1065occurred in iteration=10, InterpolantAutomatonStates: 680, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 77 MinimizatonAttempts, 3287 StatesRemovedByMinimization, 69 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 4160 NumberOfCodeBlocks, 4160 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 4080 ConstructedInterpolants, 0 QuantifiedInterpolants, 10347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1664 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 80 InterpolantComputations, 77 PerfectInterpolantSequences, 71/85 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 19:51:05,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_660504ba-41c1-4b1f-a938-875d8cabcadd/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