./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R --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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- 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-38b53e6 [2022-11-25 18:15:05,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:15:05,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:15:05,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:15:05,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:15:05,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:15:05,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:15:05,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:15:05,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:15:05,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:15:05,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:15:05,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:15:05,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:15:05,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:15:05,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:15:05,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:15:05,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:15:05,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:15:05,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:15:05,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:15:05,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:15:05,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:15:05,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:15:05,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:15:05,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:15:05,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:15:05,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:15:05,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:15:05,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:15:05,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:15:05,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:15:05,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:15:05,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:15:05,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:15:05,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:15:05,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:15:05,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:15:05,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:15:05,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:15:05,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:15:05,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:15:05,632 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:15:05,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:15:05,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:15:05,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:15:05,677 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:15:05,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:15:05,678 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:15:05,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:15:05,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:15:05,679 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:15:05,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:15:05,681 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:15:05,681 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:15:05,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:15:05,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:15:05,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:15:05,682 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:15:05,682 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:15:05,682 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:15:05,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:15:05,682 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:15:05,683 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:15:05,683 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:15:05,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:15:05,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:15:05,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:15:05,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:15:05,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:15:05,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:15:05,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:15:05,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:15:05,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:15:05,685 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:15:05,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:15:05,686 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/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_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2022-11-25 18:15:05,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:15:05,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:15:05,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:15:06,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:15:06,001 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:15:06,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/locks/test_locks_11.c [2022-11-25 18:15:09,098 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:15:09,298 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:15:09,298 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/sv-benchmarks/c/locks/test_locks_11.c [2022-11-25 18:15:09,306 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/data/fb9450cf3/c202bd5b73d44bb3942f84fc5c0c55a2/FLAGc036a65e8 [2022-11-25 18:15:09,322 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/data/fb9450cf3/c202bd5b73d44bb3942f84fc5c0c55a2 [2022-11-25 18:15:09,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:15:09,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:15:09,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:15:09,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:15:09,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:15:09,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aecdf33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09, skipping insertion in model container [2022-11-25 18:15:09,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:15:09,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:15:09,608 WARN L237 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_6e369487-b4a5-4ce1-a53e-cc00edca5c62/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-11-25 18:15:09,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:15:09,622 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:15:09,644 WARN L237 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_6e369487-b4a5-4ce1-a53e-cc00edca5c62/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-11-25 18:15:09,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:15:09,658 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:15:09,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09 WrapperNode [2022-11-25 18:15:09,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:15:09,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:15:09,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:15:09,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:15:09,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,696 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2022-11-25 18:15:09,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:15:09,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:15:09,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:15:09,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:15:09,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,737 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:15:09,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:15:09,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:15:09,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:15:09,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (1/1) ... [2022-11-25 18:15:09,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:15:09,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:15:09,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:15:09,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:15:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:15:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:15:09,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:15:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:15:09,950 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:15:09,952 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:15:10,237 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:15:10,243 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:15:10,244 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 18:15:10,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:15:10 BoogieIcfgContainer [2022-11-25 18:15:10,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:15:10,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:15:10,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:15:10,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:15:10,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:15:09" (1/3) ... [2022-11-25 18:15:10,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2790eb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:15:10, skipping insertion in model container [2022-11-25 18:15:10,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:15:09" (2/3) ... [2022-11-25 18:15:10,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2790eb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:15:10, skipping insertion in model container [2022-11-25 18:15:10,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:15:10" (3/3) ... [2022-11-25 18:15:10,256 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-11-25 18:15:10,276 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:15:10,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:15:10,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:15:10,346 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ae36072, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:15:10,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-25 18:15:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 18:15:10,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:10,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:15:10,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash 28704011, now seen corresponding path program 1 times [2022-11-25 18:15:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:10,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983758235] [2022-11-25 18:15:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:10,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:10,520 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-25 18:15:10,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:10,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983758235] [2022-11-25 18:15:10,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983758235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:10,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:10,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:15:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377514424] [2022-11-25 18:15:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:10,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:15:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:10,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:15:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:15:10,562 INFO L87 Difference]: Start difference. First operand has 44 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:10,580 INFO L93 Difference]: Finished difference Result 44 states and 76 transitions. [2022-11-25 18:15:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:15:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 18:15:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:10,591 INFO L225 Difference]: With dead ends: 44 [2022-11-25 18:15:10,591 INFO L226 Difference]: Without dead ends: 42 [2022-11-25 18:15:10,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:15:10,597 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:10,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-25 18:15:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-25 18:15:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.85) internal successors, (74), 41 states have internal predecessors, (74), 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-25 18:15:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2022-11-25 18:15:10,634 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 5 [2022-11-25 18:15:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:10,635 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2022-11-25 18:15:10,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2022-11-25 18:15:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 18:15:10,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:10,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 18:15:10,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:15:10,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 889698507, now seen corresponding path program 1 times [2022-11-25 18:15:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:10,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736936192] [2022-11-25 18:15:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:10,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:10,701 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-25 18:15:10,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:10,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736936192] [2022-11-25 18:15:10,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736936192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:10,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:10,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:15:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861321036] [2022-11-25 18:15:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:10,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:10,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:10,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:10,706 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:10,716 INFO L93 Difference]: Finished difference Result 41 states and 73 transitions. [2022-11-25 18:15:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:10,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 18:15:10,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:10,718 INFO L225 Difference]: With dead ends: 41 [2022-11-25 18:15:10,718 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 18:15:10,719 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-25 18:15:10,720 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:10,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 73 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 18:15:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-25 18:15:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 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-25 18:15:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2022-11-25 18:15:10,728 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 6 [2022-11-25 18:15:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:10,730 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 71 transitions. [2022-11-25 18:15:10,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions. [2022-11-25 18:15:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:15:10,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:10,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:10,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:15:10,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:10,737 INFO L85 PathProgramCache]: Analyzing trace with hash 458919617, now seen corresponding path program 1 times [2022-11-25 18:15:10,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:10,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052540656] [2022-11-25 18:15:10,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:10,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:10,842 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-25 18:15:10,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:10,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052540656] [2022-11-25 18:15:10,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052540656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:10,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:10,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225509273] [2022-11-25 18:15:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:10,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:10,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:10,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:10,846 INFO L87 Difference]: Start difference. First operand 39 states and 71 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:10,872 INFO L93 Difference]: Finished difference Result 75 states and 137 transitions. [2022-11-25 18:15:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:10,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 18:15:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:10,874 INFO L225 Difference]: With dead ends: 75 [2022-11-25 18:15:10,874 INFO L226 Difference]: Without dead ends: 75 [2022-11-25 18:15:10,874 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-25 18:15:10,876 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:10,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-25 18:15:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2022-11-25 18:15:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 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-25 18:15:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 94 transitions. [2022-11-25 18:15:10,885 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 94 transitions. Word has length 18 [2022-11-25 18:15:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:10,885 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 94 transitions. [2022-11-25 18:15:10,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-25 18:15:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 94 transitions. [2022-11-25 18:15:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:15:10,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:10,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:10,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:15:10,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -552197633, now seen corresponding path program 1 times [2022-11-25 18:15:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:10,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109165183] [2022-11-25 18:15:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:10,952 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-25 18:15:10,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:10,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109165183] [2022-11-25 18:15:10,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109165183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:10,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:10,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462770588] [2022-11-25 18:15:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:10,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:10,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:10,955 INFO L87 Difference]: Start difference. First operand 51 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:10,976 INFO L93 Difference]: Finished difference Result 75 states and 135 transitions. [2022-11-25 18:15:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 18:15:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:10,977 INFO L225 Difference]: With dead ends: 75 [2022-11-25 18:15:10,978 INFO L226 Difference]: Without dead ends: 75 [2022-11-25 18:15:10,978 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-25 18:15:10,979 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:10,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-25 18:15:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-11-25 18:15:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 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-25 18:15:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2022-11-25 18:15:10,989 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18 [2022-11-25 18:15:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:10,990 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 134 transitions. [2022-11-25 18:15:10,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-25 18:15:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions. [2022-11-25 18:15:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:15:10,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:10,991 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-25 18:15:10,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:15:10,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:10,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1341819263, now seen corresponding path program 1 times [2022-11-25 18:15:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:10,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593475867] [2022-11-25 18:15:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:11,104 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-25 18:15:11,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:11,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593475867] [2022-11-25 18:15:11,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593475867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:11,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:11,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436498043] [2022-11-25 18:15:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:11,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:11,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:11,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:11,108 INFO L87 Difference]: Start difference. First operand 73 states and 134 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-25 18:15:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:11,142 INFO L93 Difference]: Finished difference Result 78 states and 137 transitions. [2022-11-25 18:15:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:11,143 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), 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 19 [2022-11-25 18:15:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:11,145 INFO L225 Difference]: With dead ends: 78 [2022-11-25 18:15:11,145 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 18:15:11,145 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-25 18:15:11,147 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:11,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 18:15:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-11-25 18:15:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 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-25 18:15:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 136 transitions. [2022-11-25 18:15:11,158 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 136 transitions. Word has length 19 [2022-11-25 18:15:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:11,158 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 136 transitions. [2022-11-25 18:15:11,158 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), 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-25 18:15:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 136 transitions. [2022-11-25 18:15:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:15:11,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:11,160 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-25 18:15:11,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:15:11,160 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash 61955585, now seen corresponding path program 1 times [2022-11-25 18:15:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:11,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502703584] [2022-11-25 18:15:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:11,208 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-25 18:15:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:11,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502703584] [2022-11-25 18:15:11,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502703584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:11,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:11,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:11,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445844527] [2022-11-25 18:15:11,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:11,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:11,212 INFO L87 Difference]: Start difference. First operand 76 states and 136 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-25 18:15:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:11,232 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2022-11-25 18:15:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:11,233 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), 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 19 [2022-11-25 18:15:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:11,235 INFO L225 Difference]: With dead ends: 143 [2022-11-25 18:15:11,235 INFO L226 Difference]: Without dead ends: 143 [2022-11-25 18:15:11,235 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-25 18:15:11,237 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:11,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-25 18:15:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2022-11-25 18:15:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 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-25 18:15:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions. [2022-11-25 18:15:11,249 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 19 [2022-11-25 18:15:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:11,270 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 181 transitions. [2022-11-25 18:15:11,271 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), 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-25 18:15:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions. [2022-11-25 18:15:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:15:11,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:11,272 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-25 18:15:11,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:15:11,272 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash -949161665, now seen corresponding path program 1 times [2022-11-25 18:15:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:11,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451240576] [2022-11-25 18:15:11,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:11,372 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-25 18:15:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:11,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451240576] [2022-11-25 18:15:11,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451240576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:11,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:11,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:11,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717967011] [2022-11-25 18:15:11,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:11,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:11,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:11,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:11,376 INFO L87 Difference]: Start difference. First operand 101 states and 181 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-25 18:15:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:11,414 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2022-11-25 18:15:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:11,415 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), 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 19 [2022-11-25 18:15:11,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:11,416 INFO L225 Difference]: With dead ends: 145 [2022-11-25 18:15:11,416 INFO L226 Difference]: Without dead ends: 145 [2022-11-25 18:15:11,417 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-25 18:15:11,418 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:11,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-25 18:15:11,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2022-11-25 18:15:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 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-25 18:15:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2022-11-25 18:15:11,439 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 19 [2022-11-25 18:15:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:11,439 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 255 transitions. [2022-11-25 18:15:11,440 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), 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-25 18:15:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions. [2022-11-25 18:15:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 18:15:11,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:11,441 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] [2022-11-25 18:15:11,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:15:11,442 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1920836500, now seen corresponding path program 1 times [2022-11-25 18:15:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:11,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039976765] [2022-11-25 18:15:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:11,548 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-25 18:15:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:11,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039976765] [2022-11-25 18:15:11,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039976765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:11,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:11,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886995240] [2022-11-25 18:15:11,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:11,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:11,551 INFO L87 Difference]: Start difference. First operand 143 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-25 18:15:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:11,572 INFO L93 Difference]: Finished difference Result 147 states and 256 transitions. [2022-11-25 18:15:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-11-25 18:15:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:11,579 INFO L225 Difference]: With dead ends: 147 [2022-11-25 18:15:11,579 INFO L226 Difference]: Without dead ends: 147 [2022-11-25 18:15:11,580 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-25 18:15:11,581 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:11,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-25 18:15:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2022-11-25 18:15:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 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-25 18:15:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 255 transitions. [2022-11-25 18:15:11,626 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 255 transitions. Word has length 20 [2022-11-25 18:15:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:11,626 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 255 transitions. [2022-11-25 18:15:11,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-25 18:15:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions. [2022-11-25 18:15:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 18:15:11,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:11,628 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] [2022-11-25 18:15:11,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:15:11,629 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:11,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash 640972822, now seen corresponding path program 1 times [2022-11-25 18:15:11,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:11,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984859134] [2022-11-25 18:15:11,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:11,700 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-25 18:15:11,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:11,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984859134] [2022-11-25 18:15:11,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984859134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:11,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:11,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152210777] [2022-11-25 18:15:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:11,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:11,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:11,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:11,706 INFO L87 Difference]: Start difference. First operand 145 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-25 18:15:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:11,737 INFO L93 Difference]: Finished difference Result 279 states and 484 transitions. [2022-11-25 18:15:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:11,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-11-25 18:15:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:11,739 INFO L225 Difference]: With dead ends: 279 [2022-11-25 18:15:11,739 INFO L226 Difference]: Without dead ends: 279 [2022-11-25 18:15:11,740 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-25 18:15:11,742 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:11,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-25 18:15:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2022-11-25 18:15:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 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-25 18:15:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 483 transitions. [2022-11-25 18:15:11,777 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 483 transitions. Word has length 20 [2022-11-25 18:15:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:11,777 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 483 transitions. [2022-11-25 18:15:11,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-25 18:15:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 483 transitions. [2022-11-25 18:15:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 18:15:11,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:11,779 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] [2022-11-25 18:15:11,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:15:11,780 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:11,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1652090072, now seen corresponding path program 1 times [2022-11-25 18:15:11,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:11,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037650871] [2022-11-25 18:15:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:11,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:11,821 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-25 18:15:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:11,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037650871] [2022-11-25 18:15:11,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037650871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:11,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:11,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:11,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697826561] [2022-11-25 18:15:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:11,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:11,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:11,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:11,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:11,824 INFO L87 Difference]: Start difference. First operand 277 states and 483 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-25 18:15:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:11,835 INFO L93 Difference]: Finished difference Result 351 states and 616 transitions. [2022-11-25 18:15:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:11,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-11-25 18:15:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:11,838 INFO L225 Difference]: With dead ends: 351 [2022-11-25 18:15:11,838 INFO L226 Difference]: Without dead ends: 351 [2022-11-25 18:15:11,838 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-25 18:15:11,839 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:11,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 188 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-25 18:15:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 277. [2022-11-25 18:15:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 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-25 18:15:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 479 transitions. [2022-11-25 18:15:11,851 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 479 transitions. Word has length 20 [2022-11-25 18:15:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:11,851 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 479 transitions. [2022-11-25 18:15:11,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-25 18:15:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 479 transitions. [2022-11-25 18:15:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 18:15:11,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:11,853 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-25 18:15:11,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:15:11,854 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1604465292, now seen corresponding path program 1 times [2022-11-25 18:15:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:11,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594162465] [2022-11-25 18:15:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:11,885 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-25 18:15:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:11,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594162465] [2022-11-25 18:15:11,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594162465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:11,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:11,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94082346] [2022-11-25 18:15:11,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:11,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:11,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:11,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:11,888 INFO L87 Difference]: Start difference. First operand 277 states and 479 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:11,901 INFO L93 Difference]: Finished difference Result 515 states and 896 transitions. [2022-11-25 18:15:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:11,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 18:15:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:11,904 INFO L225 Difference]: With dead ends: 515 [2022-11-25 18:15:11,904 INFO L226 Difference]: Without dead ends: 515 [2022-11-25 18:15:11,904 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-25 18:15:11,905 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:11,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-11-25 18:15:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2022-11-25 18:15:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 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-25 18:15:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 655 transitions. [2022-11-25 18:15:11,918 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 655 transitions. Word has length 21 [2022-11-25 18:15:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:11,919 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 655 transitions. [2022-11-25 18:15:11,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-25 18:15:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 655 transitions. [2022-11-25 18:15:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 18:15:11,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:11,921 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-25 18:15:11,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:15:11,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1679384754, now seen corresponding path program 1 times [2022-11-25 18:15:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:11,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301727777] [2022-11-25 18:15:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:11,950 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-25 18:15:11,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:11,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301727777] [2022-11-25 18:15:11,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301727777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:11,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:11,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:11,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65917384] [2022-11-25 18:15:11,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:11,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:11,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:11,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:11,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:11,953 INFO L87 Difference]: Start difference. First operand 385 states and 655 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:11,967 INFO L93 Difference]: Finished difference Result 539 states and 908 transitions. [2022-11-25 18:15:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:11,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 18:15:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:11,970 INFO L225 Difference]: With dead ends: 539 [2022-11-25 18:15:11,970 INFO L226 Difference]: Without dead ends: 539 [2022-11-25 18:15:11,970 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-25 18:15:11,971 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:11,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-11-25 18:15:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2022-11-25 18:15:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 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-25 18:15:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 907 transitions. [2022-11-25 18:15:11,984 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 907 transitions. Word has length 21 [2022-11-25 18:15:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:11,985 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 907 transitions. [2022-11-25 18:15:11,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-25 18:15:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 907 transitions. [2022-11-25 18:15:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:15:11,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:11,986 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-25 18:15:11,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:15:11,987 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1801397547, now seen corresponding path program 1 times [2022-11-25 18:15:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:11,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630784413] [2022-11-25 18:15:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:11,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:12,020 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-25 18:15:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:12,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630784413] [2022-11-25 18:15:12,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630784413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:12,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:12,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:12,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473127437] [2022-11-25 18:15:12,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:12,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:12,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:12,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:12,035 INFO L87 Difference]: Start difference. First operand 537 states and 907 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-25 18:15:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:12,057 INFO L93 Difference]: Finished difference Result 551 states and 916 transitions. [2022-11-25 18:15:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:12,058 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), 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 22 [2022-11-25 18:15:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:12,060 INFO L225 Difference]: With dead ends: 551 [2022-11-25 18:15:12,060 INFO L226 Difference]: Without dead ends: 551 [2022-11-25 18:15:12,061 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-25 18:15:12,061 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:12,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-11-25 18:15:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2022-11-25 18:15:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 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-25 18:15:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions. [2022-11-25 18:15:12,079 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22 [2022-11-25 18:15:12,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:12,079 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 915 transitions. [2022-11-25 18:15:12,080 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), 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-25 18:15:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions. [2022-11-25 18:15:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:15:12,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:12,081 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-25 18:15:12,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:15:12,082 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:12,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:12,082 INFO L85 PathProgramCache]: Analyzing trace with hash 521533869, now seen corresponding path program 1 times [2022-11-25 18:15:12,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:12,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671724700] [2022-11-25 18:15:12,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:12,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:12,143 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-25 18:15:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:12,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671724700] [2022-11-25 18:15:12,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671724700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:12,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:12,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331286456] [2022-11-25 18:15:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:12,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:12,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:12,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:12,146 INFO L87 Difference]: Start difference. First operand 549 states and 915 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-25 18:15:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:12,161 INFO L93 Difference]: Finished difference Result 999 states and 1676 transitions. [2022-11-25 18:15:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:12,162 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), 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 22 [2022-11-25 18:15:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:12,166 INFO L225 Difference]: With dead ends: 999 [2022-11-25 18:15:12,166 INFO L226 Difference]: Without dead ends: 999 [2022-11-25 18:15:12,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:12,168 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:12,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-11-25 18:15:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 773. [2022-11-25 18:15:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 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-25 18:15:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions. [2022-11-25 18:15:12,190 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22 [2022-11-25 18:15:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:12,190 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions. [2022-11-25 18:15:12,190 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), 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-25 18:15:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions. [2022-11-25 18:15:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:15:12,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:12,193 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-25 18:15:12,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:15:12,193 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:12,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash -489583381, now seen corresponding path program 1 times [2022-11-25 18:15:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:12,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062403308] [2022-11-25 18:15:12,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:12,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:12,289 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-25 18:15:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:12,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062403308] [2022-11-25 18:15:12,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062403308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:12,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:12,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:12,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543663913] [2022-11-25 18:15:12,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:12,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:12,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:12,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:12,291 INFO L87 Difference]: Start difference. First operand 773 states and 1259 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-25 18:15:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:12,333 INFO L93 Difference]: Finished difference Result 1063 states and 1716 transitions. [2022-11-25 18:15:12,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:12,334 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), 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 22 [2022-11-25 18:15:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:12,338 INFO L225 Difference]: With dead ends: 1063 [2022-11-25 18:15:12,338 INFO L226 Difference]: Without dead ends: 1063 [2022-11-25 18:15:12,340 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-25 18:15:12,340 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:12,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-11-25 18:15:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2022-11-25 18:15:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 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-25 18:15:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions. [2022-11-25 18:15:12,366 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22 [2022-11-25 18:15:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:12,366 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions. [2022-11-25 18:15:12,367 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), 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-25 18:15:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions. [2022-11-25 18:15:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:15:12,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:12,368 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-25 18:15:12,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:15:12,369 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:12,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1012104857, now seen corresponding path program 1 times [2022-11-25 18:15:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:12,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354094023] [2022-11-25 18:15:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:12,424 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-25 18:15:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:12,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354094023] [2022-11-25 18:15:12,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354094023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:12,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:12,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880265733] [2022-11-25 18:15:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:12,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:12,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:12,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:12,432 INFO L87 Difference]: Start difference. First operand 1061 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-25 18:15:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:12,450 INFO L93 Difference]: Finished difference Result 1079 states and 1716 transitions. [2022-11-25 18:15:12,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:12,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-11-25 18:15:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:12,456 INFO L225 Difference]: With dead ends: 1079 [2022-11-25 18:15:12,456 INFO L226 Difference]: Without dead ends: 1079 [2022-11-25 18:15:12,456 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-25 18:15:12,457 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:12,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-11-25 18:15:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2022-11-25 18:15:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 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-25 18:15:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions. [2022-11-25 18:15:12,483 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23 [2022-11-25 18:15:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:12,484 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions. [2022-11-25 18:15:12,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-25 18:15:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions. [2022-11-25 18:15:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:15:12,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:12,486 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-25 18:15:12,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:15:12,486 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:12,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:12,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2002998761, now seen corresponding path program 1 times [2022-11-25 18:15:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:12,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806163971] [2022-11-25 18:15:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:12,530 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-25 18:15:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:12,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806163971] [2022-11-25 18:15:12,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806163971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:12,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:12,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:12,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061209759] [2022-11-25 18:15:12,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:12,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:12,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:12,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:12,534 INFO L87 Difference]: Start difference. First operand 1077 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-25 18:15:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:12,572 INFO L93 Difference]: Finished difference Result 1927 states and 3092 transitions. [2022-11-25 18:15:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:12,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-11-25 18:15:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:12,583 INFO L225 Difference]: With dead ends: 1927 [2022-11-25 18:15:12,583 INFO L226 Difference]: Without dead ends: 1927 [2022-11-25 18:15:12,583 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-25 18:15:12,584 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:12,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 129 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2022-11-25 18:15:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1541. [2022-11-25 18:15:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 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-25 18:15:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions. [2022-11-25 18:15:12,623 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23 [2022-11-25 18:15:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:12,623 INFO L495 AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions. [2022-11-25 18:15:12,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-25 18:15:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions. [2022-11-25 18:15:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:15:12,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:12,626 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-25 18:15:12,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:15:12,626 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:12,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash 991881511, now seen corresponding path program 1 times [2022-11-25 18:15:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:12,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098838968] [2022-11-25 18:15:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:12,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:12,662 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-25 18:15:12,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:12,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098838968] [2022-11-25 18:15:12,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098838968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:12,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:12,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:12,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783648188] [2022-11-25 18:15:12,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:12,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:12,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:12,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:12,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:12,664 INFO L87 Difference]: Start difference. First operand 1541 states and 2387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-25 18:15:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:12,686 INFO L93 Difference]: Finished difference Result 2087 states and 3204 transitions. [2022-11-25 18:15:12,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:12,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-11-25 18:15:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:12,693 INFO L225 Difference]: With dead ends: 2087 [2022-11-25 18:15:12,693 INFO L226 Difference]: Without dead ends: 2087 [2022-11-25 18:15:12,693 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-25 18:15:12,695 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:12,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2022-11-25 18:15:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085. [2022-11-25 18:15:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 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-25 18:15:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions. [2022-11-25 18:15:12,745 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23 [2022-11-25 18:15:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:12,745 INFO L495 AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions. [2022-11-25 18:15:12,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-25 18:15:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions. [2022-11-25 18:15:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 18:15:12,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15: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] [2022-11-25 18:15:12,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:15:12,749 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1963634176, now seen corresponding path program 1 times [2022-11-25 18:15:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75844735] [2022-11-25 18:15:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:12,785 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-25 18:15:12,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:12,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75844735] [2022-11-25 18:15:12,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75844735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:12,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:12,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482524386] [2022-11-25 18:15:12,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:12,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:12,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:12,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:12,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:12,789 INFO L87 Difference]: Start difference. First operand 2085 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:12,808 INFO L93 Difference]: Finished difference Result 2119 states and 3204 transitions. [2022-11-25 18:15:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:12,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 18:15:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:12,815 INFO L225 Difference]: With dead ends: 2119 [2022-11-25 18:15:12,815 INFO L226 Difference]: Without dead ends: 2119 [2022-11-25 18:15:12,815 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-25 18:15:12,816 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:12,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-11-25 18:15:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2117. [2022-11-25 18:15:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 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-25 18:15:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions. [2022-11-25 18:15:12,884 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24 [2022-11-25 18:15:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:12,885 INFO L495 AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions. [2022-11-25 18:15:12,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions. [2022-11-25 18:15:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 18:15:12,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:12,887 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] [2022-11-25 18:15:12,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:15:12,887 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash 683770498, now seen corresponding path program 1 times [2022-11-25 18:15:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:12,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183017341] [2022-11-25 18:15:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:12,910 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-25 18:15:12,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:12,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183017341] [2022-11-25 18:15:12,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183017341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:12,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:12,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:12,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807850152] [2022-11-25 18:15:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:12,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:12,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:12,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:12,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:12,912 INFO L87 Difference]: Start difference. First operand 2117 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:12,939 INFO L93 Difference]: Finished difference Result 3719 states and 5668 transitions. [2022-11-25 18:15:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:12,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 18:15:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:12,951 INFO L225 Difference]: With dead ends: 3719 [2022-11-25 18:15:12,951 INFO L226 Difference]: Without dead ends: 3719 [2022-11-25 18:15:12,951 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-25 18:15:12,952 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:12,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2022-11-25 18:15:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3077. [2022-11-25 18:15:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 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-25 18:15:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions. [2022-11-25 18:15:13,020 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24 [2022-11-25 18:15:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:13,020 INFO L495 AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions. [2022-11-25 18:15:13,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions. [2022-11-25 18:15:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 18:15:13,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:13,024 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] [2022-11-25 18:15:13,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 18:15:13,024 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash -327346752, now seen corresponding path program 1 times [2022-11-25 18:15:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:13,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838464163] [2022-11-25 18:15:13,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:13,046 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-25 18:15:13,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:13,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838464163] [2022-11-25 18:15:13,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838464163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:13,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:13,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700302300] [2022-11-25 18:15:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:13,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:13,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:13,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:13,048 INFO L87 Difference]: Start difference. First operand 3077 states and 4515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:13,074 INFO L93 Difference]: Finished difference Result 4103 states and 5956 transitions. [2022-11-25 18:15:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:13,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 18:15:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:13,087 INFO L225 Difference]: With dead ends: 4103 [2022-11-25 18:15:13,087 INFO L226 Difference]: Without dead ends: 4103 [2022-11-25 18:15:13,087 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-25 18:15:13,088 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:13,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-11-25 18:15:13,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4101. [2022-11-25 18:15:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 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-25 18:15:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions. [2022-11-25 18:15:13,174 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24 [2022-11-25 18:15:13,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:13,174 INFO L495 AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions. [2022-11-25 18:15:13,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions. [2022-11-25 18:15:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:15:13,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:13,178 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] [2022-11-25 18:15:13,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 18:15:13,178 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:13,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash -277735972, now seen corresponding path program 1 times [2022-11-25 18:15:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:13,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254177832] [2022-11-25 18:15:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:13,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:15:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:13,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254177832] [2022-11-25 18:15:13,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254177832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:13,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:13,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237515191] [2022-11-25 18:15:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:13,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:13,223 INFO L87 Difference]: Start difference. First operand 4101 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-25 18:15:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:13,248 INFO L93 Difference]: Finished difference Result 4167 states and 5956 transitions. [2022-11-25 18:15:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:13,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-11-25 18:15:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:13,263 INFO L225 Difference]: With dead ends: 4167 [2022-11-25 18:15:13,263 INFO L226 Difference]: Without dead ends: 4167 [2022-11-25 18:15:13,263 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-25 18:15:13,264 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:13,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2022-11-25 18:15:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4165. [2022-11-25 18:15:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 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-25 18:15:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions. [2022-11-25 18:15:13,348 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25 [2022-11-25 18:15:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:13,349 INFO L495 AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions. [2022-11-25 18:15:13,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-25 18:15:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions. [2022-11-25 18:15:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:15:13,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:13,352 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] [2022-11-25 18:15:13,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 18:15:13,353 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:13,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:13,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1557599650, now seen corresponding path program 1 times [2022-11-25 18:15:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:13,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542468406] [2022-11-25 18:15:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:13,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:13,373 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-25 18:15:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:13,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542468406] [2022-11-25 18:15:13,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542468406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:13,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:13,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:13,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729226374] [2022-11-25 18:15:13,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:13,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:13,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:13,375 INFO L87 Difference]: Start difference. First operand 4165 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-25 18:15:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:13,411 INFO L93 Difference]: Finished difference Result 7175 states and 10308 transitions. [2022-11-25 18:15:13,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:13,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-11-25 18:15:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:13,425 INFO L225 Difference]: With dead ends: 7175 [2022-11-25 18:15:13,425 INFO L226 Difference]: Without dead ends: 7175 [2022-11-25 18:15:13,425 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-25 18:15:13,425 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:13,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7175 states. [2022-11-25 18:15:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 6149. [2022-11-25 18:15:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 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-25 18:15:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions. [2022-11-25 18:15:13,581 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25 [2022-11-25 18:15:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:13,581 INFO L495 AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions. [2022-11-25 18:15:13,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-25 18:15:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions. [2022-11-25 18:15:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:15:13,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:13,590 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] [2022-11-25 18:15:13,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 18:15:13,591 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1726250396, now seen corresponding path program 1 times [2022-11-25 18:15:13,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:13,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316612098] [2022-11-25 18:15:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:13,615 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-25 18:15:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:13,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316612098] [2022-11-25 18:15:13,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316612098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:13,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:13,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732606210] [2022-11-25 18:15:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:13,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:13,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:13,617 INFO L87 Difference]: Start difference. First operand 6149 states and 8515 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-25 18:15:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:13,664 INFO L93 Difference]: Finished difference Result 8071 states and 11012 transitions. [2022-11-25 18:15:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-11-25 18:15:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:13,682 INFO L225 Difference]: With dead ends: 8071 [2022-11-25 18:15:13,682 INFO L226 Difference]: Without dead ends: 8071 [2022-11-25 18:15:13,682 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-25 18:15:13,683 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:13,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:13,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2022-11-25 18:15:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 8069. [2022-11-25 18:15:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 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-25 18:15:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions. [2022-11-25 18:15:13,832 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25 [2022-11-25 18:15:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:13,833 INFO L495 AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions. [2022-11-25 18:15:13,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-25 18:15:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions. [2022-11-25 18:15:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:15:13,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:13,840 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] [2022-11-25 18:15:13,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 18:15:13,840 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:13,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1040733483, now seen corresponding path program 1 times [2022-11-25 18:15:13,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:13,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947261539] [2022-11-25 18:15:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:13,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:13,871 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-25 18:15:13,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947261539] [2022-11-25 18:15:13,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947261539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:13,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:13,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:13,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259718589] [2022-11-25 18:15:13,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:13,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:13,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:13,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:13,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:13,873 INFO L87 Difference]: Start difference. First operand 8069 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:13,939 INFO L93 Difference]: Finished difference Result 8199 states and 11012 transitions. [2022-11-25 18:15:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:13,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 18:15:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:13,952 INFO L225 Difference]: With dead ends: 8199 [2022-11-25 18:15:13,952 INFO L226 Difference]: Without dead ends: 8199 [2022-11-25 18:15:13,953 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-25 18:15:13,953 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:13,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2022-11-25 18:15:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8197. [2022-11-25 18:15:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 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-25 18:15:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions. [2022-11-25 18:15:14,101 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26 [2022-11-25 18:15:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:14,101 INFO L495 AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions. [2022-11-25 18:15:14,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions. [2022-11-25 18:15:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:15:14,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:14,109 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] [2022-11-25 18:15:14,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 18:15:14,110 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:14,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1974370135, now seen corresponding path program 1 times [2022-11-25 18:15:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:14,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004075507] [2022-11-25 18:15:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:14,131 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-25 18:15:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:14,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004075507] [2022-11-25 18:15:14,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004075507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:14,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:14,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637701432] [2022-11-25 18:15:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:14,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:14,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:14,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:14,134 INFO L87 Difference]: Start difference. First operand 8197 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:14,185 INFO L93 Difference]: Finished difference Result 13831 states and 18564 transitions. [2022-11-25 18:15:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:14,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 18:15:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:14,211 INFO L225 Difference]: With dead ends: 13831 [2022-11-25 18:15:14,211 INFO L226 Difference]: Without dead ends: 13831 [2022-11-25 18:15:14,211 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-25 18:15:14,212 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:14,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13831 states. [2022-11-25 18:15:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 12293. [2022-11-25 18:15:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 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-25 18:15:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12293 states to 12293 states and 16003 transitions. [2022-11-25 18:15:14,502 INFO L78 Accepts]: Start accepts. Automaton has 12293 states and 16003 transitions. Word has length 26 [2022-11-25 18:15:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:14,502 INFO L495 AbstractCegarLoop]: Abstraction has 12293 states and 16003 transitions. [2022-11-25 18:15:14,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 12293 states and 16003 transitions. [2022-11-25 18:15:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:15:14,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:14,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:14,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 18:15:14,564 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash 963252885, now seen corresponding path program 1 times [2022-11-25 18:15:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:14,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451161342] [2022-11-25 18:15:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:14,585 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-25 18:15:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:14,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451161342] [2022-11-25 18:15:14,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451161342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:14,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:14,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732665095] [2022-11-25 18:15:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:14,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:14,588 INFO L87 Difference]: Start difference. First operand 12293 states and 16003 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:14,650 INFO L93 Difference]: Finished difference Result 15879 states and 20228 transitions. [2022-11-25 18:15:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:14,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 18:15:14,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:14,677 INFO L225 Difference]: With dead ends: 15879 [2022-11-25 18:15:14,678 INFO L226 Difference]: Without dead ends: 15879 [2022-11-25 18:15:14,678 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-25 18:15:14,678 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:14,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15879 states. [2022-11-25 18:15:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15877. [2022-11-25 18:15:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15876 states have (on average 1.2740614764424287) internal successors, (20227), 15876 states have internal predecessors, (20227), 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-25 18:15:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 20227 transitions. [2022-11-25 18:15:15,068 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 20227 transitions. Word has length 26 [2022-11-25 18:15:15,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:15,068 INFO L495 AbstractCegarLoop]: Abstraction has 15877 states and 20227 transitions. [2022-11-25 18:15:15,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 20227 transitions. [2022-11-25 18:15:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:15:15,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:15,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:15,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 18:15:15,087 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1076147793, now seen corresponding path program 1 times [2022-11-25 18:15:15,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:15,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295599264] [2022-11-25 18:15:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:15,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-25 18:15:15,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:15,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295599264] [2022-11-25 18:15:15,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295599264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:15,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:15,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:15,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069932685] [2022-11-25 18:15:15,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:15,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:15,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:15,127 INFO L87 Difference]: Start difference. First operand 15877 states and 20227 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:15,190 INFO L93 Difference]: Finished difference Result 16135 states and 20228 transitions. [2022-11-25 18:15:15,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:15,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:15:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:15,222 INFO L225 Difference]: With dead ends: 16135 [2022-11-25 18:15:15,222 INFO L226 Difference]: Without dead ends: 16135 [2022-11-25 18:15:15,223 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-25 18:15:15,223 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:15,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2022-11-25 18:15:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 16133. [2022-11-25 18:15:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16133 states, 16132 states have (on average 1.2538432928341186) internal successors, (20227), 16132 states have internal predecessors, (20227), 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-25 18:15:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 20227 transitions. [2022-11-25 18:15:15,608 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 20227 transitions. Word has length 27 [2022-11-25 18:15:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:15,609 INFO L495 AbstractCegarLoop]: Abstraction has 16133 states and 20227 transitions. [2022-11-25 18:15:15,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 20227 transitions. [2022-11-25 18:15:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:15:15,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:15,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:15,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 18:15:15,624 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash -203715885, now seen corresponding path program 1 times [2022-11-25 18:15:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:15,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765419135] [2022-11-25 18:15:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:15,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:15,649 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-25 18:15:15,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:15,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765419135] [2022-11-25 18:15:15,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765419135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:15,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852833247] [2022-11-25 18:15:15,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:15,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:15,652 INFO L87 Difference]: Start difference. First operand 16133 states and 20227 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:15,722 INFO L93 Difference]: Finished difference Result 26631 states and 33028 transitions. [2022-11-25 18:15:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:15:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:15,769 INFO L225 Difference]: With dead ends: 26631 [2022-11-25 18:15:15,770 INFO L226 Difference]: Without dead ends: 26631 [2022-11-25 18:15:15,770 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-25 18:15:15,771 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:15,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26631 states. [2022-11-25 18:15:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26631 to 24581. [2022-11-25 18:15:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24581 states, 24580 states have (on average 1.2186737184703011) internal successors, (29955), 24580 states have internal predecessors, (29955), 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-25 18:15:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24581 states to 24581 states and 29955 transitions. [2022-11-25 18:15:16,311 INFO L78 Accepts]: Start accepts. Automaton has 24581 states and 29955 transitions. Word has length 27 [2022-11-25 18:15:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:16,311 INFO L495 AbstractCegarLoop]: Abstraction has 24581 states and 29955 transitions. [2022-11-25 18:15:16,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 24581 states and 29955 transitions. [2022-11-25 18:15:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:15:16,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:16,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:16,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 18:15:16,351 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:16,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:16,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1214833135, now seen corresponding path program 1 times [2022-11-25 18:15:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:16,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636789005] [2022-11-25 18:15:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:16,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:16,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-25 18:15:16,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:16,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636789005] [2022-11-25 18:15:16,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636789005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:16,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:16,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472068994] [2022-11-25 18:15:16,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:16,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:16,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:16,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:16,393 INFO L87 Difference]: Start difference. First operand 24581 states and 29955 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:16,662 INFO L93 Difference]: Finished difference Result 31239 states and 36868 transitions. [2022-11-25 18:15:16,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:16,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:15:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:16,736 INFO L225 Difference]: With dead ends: 31239 [2022-11-25 18:15:16,736 INFO L226 Difference]: Without dead ends: 31239 [2022-11-25 18:15:16,737 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-25 18:15:16,802 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:16,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31239 states. [2022-11-25 18:15:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31239 to 31237. [2022-11-25 18:15:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31237 states, 31236 states have (on average 1.1802727621974645) internal successors, (36867), 31236 states have internal predecessors, (36867), 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-25 18:15:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31237 states to 31237 states and 36867 transitions. [2022-11-25 18:15:17,374 INFO L78 Accepts]: Start accepts. Automaton has 31237 states and 36867 transitions. Word has length 27 [2022-11-25 18:15:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:17,375 INFO L495 AbstractCegarLoop]: Abstraction has 31237 states and 36867 transitions. [2022-11-25 18:15:17,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:15:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31237 states and 36867 transitions. [2022-11-25 18:15:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:15:17,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:17,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:17,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 18:15:17,414 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:17,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2020009046, now seen corresponding path program 1 times [2022-11-25 18:15:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:17,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465908743] [2022-11-25 18:15:17,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:17,440 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-25 18:15:17,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:17,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465908743] [2022-11-25 18:15:17,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465908743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:17,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:17,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:17,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614611338] [2022-11-25 18:15:17,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:17,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:17,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:17,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:17,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:17,443 INFO L87 Difference]: Start difference. First operand 31237 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-25 18:15:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:17,554 INFO L93 Difference]: Finished difference Result 31751 states and 36868 transitions. [2022-11-25 18:15:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:17,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-11-25 18:15:17,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:17,614 INFO L225 Difference]: With dead ends: 31751 [2022-11-25 18:15:17,614 INFO L226 Difference]: Without dead ends: 31751 [2022-11-25 18:15:17,614 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-25 18:15:17,615 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:17,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31751 states. [2022-11-25 18:15:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31751 to 31749. [2022-11-25 18:15:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.1612385032128008) internal successors, (36867), 31748 states have internal predecessors, (36867), 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-25 18:15:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 36867 transitions. [2022-11-25 18:15:18,268 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 36867 transitions. Word has length 28 [2022-11-25 18:15:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:18,268 INFO L495 AbstractCegarLoop]: Abstraction has 31749 states and 36867 transitions. [2022-11-25 18:15:18,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-25 18:15:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 36867 transitions. [2022-11-25 18:15:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:15:18,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:18,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:18,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 18:15:18,290 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash 995094572, now seen corresponding path program 1 times [2022-11-25 18:15:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:18,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659844966] [2022-11-25 18:15:18,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:18,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:18,319 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-25 18:15:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:18,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659844966] [2022-11-25 18:15:18,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659844966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:18,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:18,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:18,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919915042] [2022-11-25 18:15:18,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:18,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:18,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:18,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:18,324 INFO L87 Difference]: Start difference. First operand 31749 states and 36867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-25 18:15:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:18,689 INFO L93 Difference]: Finished difference Result 61445 states and 67587 transitions. [2022-11-25 18:15:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:18,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-11-25 18:15:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:18,758 INFO L225 Difference]: With dead ends: 61445 [2022-11-25 18:15:18,758 INFO L226 Difference]: Without dead ends: 31749 [2022-11-25 18:15:18,759 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-25 18:15:18,760 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:18,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31749 states. [2022-11-25 18:15:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31749 to 31749. [2022-11-25 18:15:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.096730502708832) internal successors, (34819), 31748 states have internal predecessors, (34819), 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-25 18:15:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 34819 transitions. [2022-11-25 18:15:19,427 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 34819 transitions. Word has length 28 [2022-11-25 18:15:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:19,427 INFO L495 AbstractCegarLoop]: Abstraction has 31749 states and 34819 transitions. [2022-11-25 18:15:19,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-25 18:15:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 34819 transitions. [2022-11-25 18:15:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:15:19,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:19,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:19,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 18:15:19,456 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-11-25 18:15:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2006211822, now seen corresponding path program 1 times [2022-11-25 18:15:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:19,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834821481] [2022-11-25 18:15:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:19,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:19,496 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-25 18:15:19,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:19,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834821481] [2022-11-25 18:15:19,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834821481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:15:19,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:15:19,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:15:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230803927] [2022-11-25 18:15:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:19,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:15:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:15:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:15:19,500 INFO L87 Difference]: Start difference. First operand 31749 states and 34819 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-25 18:15:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:19,600 INFO L93 Difference]: Finished difference Result 31747 states and 33794 transitions. [2022-11-25 18:15:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:15:19,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-11-25 18:15:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:19,602 INFO L225 Difference]: With dead ends: 31747 [2022-11-25 18:15:19,602 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:15:19,602 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-25 18:15:19,603 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:19,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:15:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:15:19,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:15:19,604 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-25 18:15:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:15:19,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-11-25 18:15:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:19,605 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:15:19,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-25 18:15:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:15:19,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:15:19,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-11-25 18:15:19,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-11-25 18:15:19,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 18:15:19,613 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:19,617 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:15:19,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:15:19 BoogieIcfgContainer [2022-11-25 18:15:19,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:15:19,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:15:19,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:15:19,622 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:15:19,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:15:10" (3/4) ... [2022-11-25 18:15:19,627 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:15:19,642 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-25 18:15:19,643 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 18:15:19,643 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 18:15:19,643 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:15:19,695 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:15:19,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:15:19,700 INFO L158 Benchmark]: Toolchain (without parser) took 10374.57ms. Allocated memory was 153.1MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 114.1MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 554.2MB. Max. memory is 16.1GB. [2022-11-25 18:15:19,702 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 121.6MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:15:19,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.19ms. Allocated memory is still 153.1MB. Free memory was 113.7MB in the beginning and 116.7MB in the end (delta: -3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:15:19,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.15ms. Allocated memory is still 153.1MB. Free memory was 116.7MB in the beginning and 114.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:15:19,706 INFO L158 Benchmark]: Boogie Preprocessor took 55.49ms. Allocated memory is still 153.1MB. Free memory was 114.6MB in the beginning and 113.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:15:19,706 INFO L158 Benchmark]: RCFGBuilder took 492.56ms. Allocated memory is still 153.1MB. Free memory was 113.1MB in the beginning and 97.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 18:15:19,708 INFO L158 Benchmark]: TraceAbstraction took 9372.19ms. Allocated memory was 153.1MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 97.4MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 535.1MB. Max. memory is 16.1GB. [2022-11-25 18:15:19,708 INFO L158 Benchmark]: Witness Printer took 78.21ms. Allocated memory is still 5.7GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:15:19,709 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.27ms. Allocated memory is still 121.6MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.19ms. Allocated memory is still 153.1MB. Free memory was 113.7MB in the beginning and 116.7MB in the end (delta: -3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.15ms. Allocated memory is still 153.1MB. Free memory was 116.7MB in the beginning and 114.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.49ms. Allocated memory is still 153.1MB. Free memory was 114.6MB in the beginning and 113.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 492.56ms. Allocated memory is still 153.1MB. Free memory was 113.1MB in the beginning and 97.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9372.19ms. Allocated memory was 153.1MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 97.4MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 535.1MB. Max. memory is 16.1GB. * Witness Printer took 78.21ms. Allocated memory is still 5.7GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 4.2MB). Peak memory consumption was 4.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: 177]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: 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 1 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1464 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1464 mSDsluCounter, 4725 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1831 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2894 mSDtfsCounter, 164 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31749occurred in iteration=31, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 698 ConstructedInterpolants, 0 QuantifiedInterpolants, 1509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-25 18:15:19,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e369487-b4a5-4ce1-a53e-cc00edca5c62/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE