./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/locks/test_locks_15-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY --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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 07:59:34,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 07:59:34,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 07:59:34,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 07:59:34,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 07:59:34,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 07:59:34,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 07:59:34,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 07:59:34,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 07:59:34,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 07:59:34,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 07:59:34,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 07:59:34,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 07:59:34,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 07:59:34,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 07:59:34,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 07:59:34,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 07:59:34,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 07:59:34,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 07:59:34,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 07:59:34,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 07:59:34,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 07:59:34,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 07:59:34,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 07:59:34,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 07:59:34,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 07:59:34,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 07:59:34,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 07:59:34,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 07:59:34,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 07:59:34,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 07:59:34,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 07:59:34,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 07:59:34,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 07:59:34,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 07:59:34,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 07:59:34,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 07:59:34,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 07:59:34,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 07:59:34,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 07:59:34,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 07:59:34,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-07 07:59:34,486 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 07:59:34,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 07:59:34,487 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 07:59:34,487 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 07:59:34,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 07:59:34,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 07:59:34,496 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 07:59:34,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 07:59:34,496 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 07:59:34,497 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 07:59:34,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 07:59:34,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 07:59:34,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 07:59:34,499 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 07:59:34,499 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 07:59:34,499 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-07 07:59:34,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 07:59:34,500 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 07:59:34,500 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 07:59:34,500 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 07:59:34,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 07:59:34,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 07:59:34,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 07:59:34,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:59:34,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 07:59:34,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 07:59:34,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 07:59:34,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 07:59:34,502 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 07:59:34,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/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_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2021-11-07 07:59:34,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 07:59:34,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 07:59:34,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 07:59:34,815 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 07:59:34,816 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 07:59:34,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/locks/test_locks_15-2.c [2021-11-07 07:59:34,887 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/data/1a9a65459/75dba7d92468498e8f9207ccfa13ca06/FLAGfb30efdb6 [2021-11-07 07:59:35,382 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 07:59:35,383 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/sv-benchmarks/c/locks/test_locks_15-2.c [2021-11-07 07:59:35,394 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/data/1a9a65459/75dba7d92468498e8f9207ccfa13ca06/FLAGfb30efdb6 [2021-11-07 07:59:35,734 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/data/1a9a65459/75dba7d92468498e8f9207ccfa13ca06 [2021-11-07 07:59:35,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 07:59:35,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-07 07:59:35,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 07:59:35,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 07:59:35,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 07:59:35,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:59:35" (1/1) ... [2021-11-07 07:59:35,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f242960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:35, skipping insertion in model container [2021-11-07 07:59:35,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:59:35" (1/1) ... [2021-11-07 07:59:35,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 07:59:35,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 07:59:35,999 WARN L228 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_e6b0ed47-266b-4c0b-96b8-b8046008faaa/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2021-11-07 07:59:36,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:59:36,014 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 07:59:36,044 WARN L228 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_e6b0ed47-266b-4c0b-96b8-b8046008faaa/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2021-11-07 07:59:36,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:59:36,060 INFO L208 MainTranslator]: Completed translation [2021-11-07 07:59:36,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36 WrapperNode [2021-11-07 07:59:36,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 07:59:36,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 07:59:36,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 07:59:36,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 07:59:36,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36" (1/1) ... [2021-11-07 07:59:36,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36" (1/1) ... [2021-11-07 07:59:36,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36" (1/1) ... [2021-11-07 07:59:36,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36" (1/1) ... [2021-11-07 07:59:36,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36" (1/1) ... [2021-11-07 07:59:36,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36" (1/1) ... [2021-11-07 07:59:36,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36" (1/1) ... [2021-11-07 07:59:36,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 07:59:36,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 07:59:36,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 07:59:36,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 07:59:36,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36" (1/1) ... [2021-11-07 07:59:36,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:59:36,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:59:36,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 07:59:36,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6b0ed47-266b-4c0b-96b8-b8046008faaa/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 07:59:36,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-07 07:59:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 07:59:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-07 07:59:36,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-07 07:59:36,198 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-07 07:59:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-07 07:59:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-07 07:59:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 07:59:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-07 07:59:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-07 07:59:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-07 07:59:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 07:59:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 07:59:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 07:59:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 07:59:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 07:59:36,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 07:59:36,634 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-07 07:59:36,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:59:36 BoogieIcfgContainer [2021-11-07 07:59:36,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 07:59:36,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 07:59:36,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 07:59:36,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 07:59:36,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:59:35" (1/3) ... [2021-11-07 07:59:36,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d90154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:59:36, skipping insertion in model container [2021-11-07 07:59:36,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:36" (2/3) ... [2021-11-07 07:59:36,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d90154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:59:36, skipping insertion in model container [2021-11-07 07:59:36,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:59:36" (3/3) ... [2021-11-07 07:59:36,652 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2021-11-07 07:59:36,662 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 07:59:36,662 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 07:59:36,711 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 07:59:36,722 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 07:59:36,722 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 07:59:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 56 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-07 07:59:36,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 07:59:36,748 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:36,748 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:36,749 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1791742257, now seen corresponding path program 1 times [2021-11-07 07:59:36,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:36,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349019906] [2021-11-07 07:59:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:36,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:37,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:37,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:37,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349019906] [2021-11-07 07:59:37,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349019906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:37,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:37,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 07:59:37,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036544064] [2021-11-07 07:59:37,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 07:59:37,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:37,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 07:59:37,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 07:59:37,076 INFO L87 Difference]: Start difference. First operand has 61 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 56 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:37,121 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2021-11-07 07:59:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 07:59:37,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-11-07 07:59:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:37,132 INFO L225 Difference]: With dead ends: 60 [2021-11-07 07:59:37,133 INFO L226 Difference]: Without dead ends: 55 [2021-11-07 07:59:37,134 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 07:59:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-11-07 07:59:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-11-07 07:59:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 99 transitions. [2021-11-07 07:59:37,189 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 99 transitions. Word has length 9 [2021-11-07 07:59:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:37,190 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 99 transitions. [2021-11-07 07:59:37,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 99 transitions. [2021-11-07 07:59:37,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 07:59:37,192 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:37,192 INFO L513 BasicCegarLoop]: 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] [2021-11-07 07:59:37,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 07:59:37,193 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:37,194 INFO L85 PathProgramCache]: Analyzing trace with hash -553613690, now seen corresponding path program 1 times [2021-11-07 07:59:37,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:37,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568544834] [2021-11-07 07:59:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:37,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:37,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:37,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:37,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568544834] [2021-11-07 07:59:37,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568544834] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:37,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:37,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:37,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246089101] [2021-11-07 07:59:37,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:37,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:37,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:37,416 INFO L87 Difference]: Start difference. First operand 55 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:37,726 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2021-11-07 07:59:37,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:37,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-11-07 07:59:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:37,735 INFO L225 Difference]: With dead ends: 103 [2021-11-07 07:59:37,737 INFO L226 Difference]: Without dead ends: 103 [2021-11-07 07:59:37,738 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-07 07:59:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2021-11-07 07:59:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2021-11-07 07:59:37,770 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2021-11-07 07:59:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:37,771 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2021-11-07 07:59:37,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2021-11-07 07:59:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 07:59:37,774 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:37,774 INFO L513 BasicCegarLoop]: 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] [2021-11-07 07:59:37,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 07:59:37,775 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:37,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1747208900, now seen corresponding path program 1 times [2021-11-07 07:59:37,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:37,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809173276] [2021-11-07 07:59:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:37,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:38,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:38,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809173276] [2021-11-07 07:59:38,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809173276] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:38,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:38,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:38,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131834288] [2021-11-07 07:59:38,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:38,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:38,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:38,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:38,003 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:38,227 INFO L93 Difference]: Finished difference Result 103 states and 187 transitions. [2021-11-07 07:59:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:38,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-11-07 07:59:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:38,230 INFO L225 Difference]: With dead ends: 103 [2021-11-07 07:59:38,230 INFO L226 Difference]: Without dead ends: 103 [2021-11-07 07:59:38,231 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-07 07:59:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-11-07 07:59:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2021-11-07 07:59:38,242 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 26 [2021-11-07 07:59:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:38,243 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 186 transitions. [2021-11-07 07:59:38,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 186 transitions. [2021-11-07 07:59:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 07:59:38,245 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:38,245 INFO L513 BasicCegarLoop]: 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] [2021-11-07 07:59:38,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 07:59:38,245 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:38,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash 18056557, now seen corresponding path program 1 times [2021-11-07 07:59:38,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:38,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533206863] [2021-11-07 07:59:38,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:38,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:38,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:38,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:38,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533206863] [2021-11-07 07:59:38,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533206863] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:38,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:38,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:38,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886290156] [2021-11-07 07:59:38,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:38,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:38,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:38,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:38,367 INFO L87 Difference]: Start difference. First operand 101 states and 186 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:38,558 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2021-11-07 07:59:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:38,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-07 07:59:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:38,562 INFO L225 Difference]: With dead ends: 106 [2021-11-07 07:59:38,562 INFO L226 Difference]: Without dead ends: 106 [2021-11-07 07:59:38,563 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-11-07 07:59:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2021-11-07 07:59:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2021-11-07 07:59:38,589 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 27 [2021-11-07 07:59:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:38,590 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2021-11-07 07:59:38,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2021-11-07 07:59:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 07:59:38,592 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:38,593 INFO L513 BasicCegarLoop]: 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] [2021-11-07 07:59:38,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 07:59:38,593 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:38,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1670887185, now seen corresponding path program 1 times [2021-11-07 07:59:38,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:38,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360197759] [2021-11-07 07:59:38,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:38,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:38,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:38,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:38,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360197759] [2021-11-07 07:59:38,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360197759] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:38,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:38,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:38,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862437575] [2021-11-07 07:59:38,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:38,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:38,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:38,738 INFO L87 Difference]: Start difference. First operand 104 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:38,932 INFO L93 Difference]: Finished difference Result 197 states and 358 transitions. [2021-11-07 07:59:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:38,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-07 07:59:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:38,935 INFO L225 Difference]: With dead ends: 197 [2021-11-07 07:59:38,936 INFO L226 Difference]: Without dead ends: 197 [2021-11-07 07:59:38,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-07 07:59:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2021-11-07 07:59:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8534031413612566) internal successors, (354), 191 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 357 transitions. [2021-11-07 07:59:38,969 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 357 transitions. Word has length 27 [2021-11-07 07:59:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:38,970 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 357 transitions. [2021-11-07 07:59:38,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 357 transitions. [2021-11-07 07:59:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 07:59:38,973 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:38,973 INFO L513 BasicCegarLoop]: 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] [2021-11-07 07:59:38,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 07:59:38,974 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:38,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:38,975 INFO L85 PathProgramCache]: Analyzing trace with hash 323257521, now seen corresponding path program 1 times [2021-11-07 07:59:38,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:38,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215502936] [2021-11-07 07:59:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:38,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:39,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:39,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215502936] [2021-11-07 07:59:39,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215502936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:39,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:39,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:39,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465851023] [2021-11-07 07:59:39,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:39,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:39,089 INFO L87 Difference]: Start difference. First operand 195 states and 357 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:39,261 INFO L93 Difference]: Finished difference Result 253 states and 464 transitions. [2021-11-07 07:59:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:39,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-07 07:59:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:39,264 INFO L225 Difference]: With dead ends: 253 [2021-11-07 07:59:39,264 INFO L226 Difference]: Without dead ends: 253 [2021-11-07 07:59:39,265 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-07 07:59:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 195. [2021-11-07 07:59:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.8429319371727748) internal successors, (352), 191 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 355 transitions. [2021-11-07 07:59:39,284 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 355 transitions. Word has length 27 [2021-11-07 07:59:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:39,286 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 355 transitions. [2021-11-07 07:59:39,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 355 transitions. [2021-11-07 07:59:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 07:59:39,293 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:39,293 INFO L513 BasicCegarLoop]: 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] [2021-11-07 07:59:39,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 07:59:39,294 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash -257683079, now seen corresponding path program 1 times [2021-11-07 07:59:39,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:39,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867030244] [2021-11-07 07:59:39,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:39,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:39,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:39,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:39,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867030244] [2021-11-07 07:59:39,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867030244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:39,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:39,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:39,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773031471] [2021-11-07 07:59:39,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:39,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:39,395 INFO L87 Difference]: Start difference. First operand 195 states and 355 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:39,547 INFO L93 Difference]: Finished difference Result 369 states and 678 transitions. [2021-11-07 07:59:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:39,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-11-07 07:59:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:39,551 INFO L225 Difference]: With dead ends: 369 [2021-11-07 07:59:39,551 INFO L226 Difference]: Without dead ends: 369 [2021-11-07 07:59:39,552 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-07 07:59:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 263. [2021-11-07 07:59:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 1.83011583011583) internal successors, (474), 259 states have internal predecessors, (474), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 477 transitions. [2021-11-07 07:59:39,562 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 477 transitions. Word has length 28 [2021-11-07 07:59:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:39,562 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 477 transitions. [2021-11-07 07:59:39,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 477 transitions. [2021-11-07 07:59:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 07:59:39,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:39,564 INFO L513 BasicCegarLoop]: 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] [2021-11-07 07:59:39,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 07:59:39,565 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2043139511, now seen corresponding path program 1 times [2021-11-07 07:59:39,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:39,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128587188] [2021-11-07 07:59:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:39,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:39,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:39,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:39,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128587188] [2021-11-07 07:59:39,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128587188] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:39,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:39,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:39,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264207050] [2021-11-07 07:59:39,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:39,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:39,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:39,622 INFO L87 Difference]: Start difference. First operand 263 states and 477 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:39,796 INFO L93 Difference]: Finished difference Result 377 states and 680 transitions. [2021-11-07 07:59:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:39,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-11-07 07:59:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:39,800 INFO L225 Difference]: With dead ends: 377 [2021-11-07 07:59:39,800 INFO L226 Difference]: Without dead ends: 377 [2021-11-07 07:59:39,801 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-07 07:59:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2021-11-07 07:59:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 371 states have (on average 1.8221024258760108) internal successors, (676), 371 states have internal predecessors, (676), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 679 transitions. [2021-11-07 07:59:39,813 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 679 transitions. Word has length 28 [2021-11-07 07:59:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:39,814 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 679 transitions. [2021-11-07 07:59:39,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 679 transitions. [2021-11-07 07:59:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 07:59:39,815 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:39,816 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:39,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 07:59:39,816 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:39,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 601971588, now seen corresponding path program 1 times [2021-11-07 07:59:39,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:39,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023118043] [2021-11-07 07:59:39,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:39,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:39,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:39,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023118043] [2021-11-07 07:59:39,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023118043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:39,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:39,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:39,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801131261] [2021-11-07 07:59:39,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:39,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:39,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:39,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:39,898 INFO L87 Difference]: Start difference. First operand 375 states and 679 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:40,070 INFO L93 Difference]: Finished difference Result 383 states and 684 transitions. [2021-11-07 07:59:40,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-11-07 07:59:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:40,075 INFO L225 Difference]: With dead ends: 383 [2021-11-07 07:59:40,075 INFO L226 Difference]: Without dead ends: 383 [2021-11-07 07:59:40,077 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-11-07 07:59:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2021-11-07 07:59:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 377 states have (on average 1.8037135278514589) internal successors, (680), 377 states have internal predecessors, (680), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 683 transitions. [2021-11-07 07:59:40,088 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 683 transitions. Word has length 29 [2021-11-07 07:59:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:40,089 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 683 transitions. [2021-11-07 07:59:40,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 683 transitions. [2021-11-07 07:59:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 07:59:40,093 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:40,098 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:40,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 07:59:40,099 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:40,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1086972154, now seen corresponding path program 1 times [2021-11-07 07:59:40,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:40,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301684042] [2021-11-07 07:59:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:40,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:40,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:40,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301684042] [2021-11-07 07:59:40,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301684042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:40,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:40,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:40,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444115097] [2021-11-07 07:59:40,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:40,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:40,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:40,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:40,188 INFO L87 Difference]: Start difference. First operand 381 states and 683 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:40,381 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2021-11-07 07:59:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:40,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-11-07 07:59:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:40,386 INFO L225 Difference]: With dead ends: 715 [2021-11-07 07:59:40,386 INFO L226 Difference]: Without dead ends: 715 [2021-11-07 07:59:40,387 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2021-11-07 07:59:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 521. [2021-11-07 07:59:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.7794970986460348) internal successors, (920), 517 states have internal predecessors, (920), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 923 transitions. [2021-11-07 07:59:40,404 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 923 transitions. Word has length 29 [2021-11-07 07:59:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:40,405 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 923 transitions. [2021-11-07 07:59:40,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 923 transitions. [2021-11-07 07:59:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 07:59:40,406 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:40,407 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:40,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 07:59:40,407 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1213850436, now seen corresponding path program 1 times [2021-11-07 07:59:40,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:40,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706728816] [2021-11-07 07:59:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:40,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:40,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:40,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706728816] [2021-11-07 07:59:40,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706728816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:40,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:40,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:40,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654632449] [2021-11-07 07:59:40,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:40,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:40,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:40,471 INFO L87 Difference]: Start difference. First operand 521 states and 923 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:40,639 INFO L93 Difference]: Finished difference Result 739 states and 1304 transitions. [2021-11-07 07:59:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:40,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-11-07 07:59:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:40,645 INFO L225 Difference]: With dead ends: 739 [2021-11-07 07:59:40,645 INFO L226 Difference]: Without dead ends: 739 [2021-11-07 07:59:40,646 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-11-07 07:59:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2021-11-07 07:59:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 733 states have (on average 1.7735334242837653) internal successors, (1300), 733 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1303 transitions. [2021-11-07 07:59:40,668 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1303 transitions. Word has length 29 [2021-11-07 07:59:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:40,668 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 1303 transitions. [2021-11-07 07:59:40,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1303 transitions. [2021-11-07 07:59:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 07:59:40,670 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:40,670 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:40,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 07:59:40,673 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash 663814380, now seen corresponding path program 1 times [2021-11-07 07:59:40,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:40,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598407300] [2021-11-07 07:59:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:40,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:40,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:40,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:40,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598407300] [2021-11-07 07:59:40,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598407300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:40,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:40,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:40,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653628964] [2021-11-07 07:59:40,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:40,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:40,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:40,736 INFO L87 Difference]: Start difference. First operand 737 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:40,906 INFO L93 Difference]: Finished difference Result 747 states and 1304 transitions. [2021-11-07 07:59:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:40,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-11-07 07:59:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:40,912 INFO L225 Difference]: With dead ends: 747 [2021-11-07 07:59:40,912 INFO L226 Difference]: Without dead ends: 747 [2021-11-07 07:59:40,912 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-11-07 07:59:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2021-11-07 07:59:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 741 states have (on average 1.7543859649122806) internal successors, (1300), 741 states have internal predecessors, (1300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1303 transitions. [2021-11-07 07:59:40,949 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1303 transitions. Word has length 30 [2021-11-07 07:59:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:40,949 INFO L470 AbstractCegarLoop]: Abstraction has 745 states and 1303 transitions. [2021-11-07 07:59:40,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1303 transitions. [2021-11-07 07:59:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 07:59:40,951 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:40,951 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:40,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 07:59:40,952 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1025129362, now seen corresponding path program 1 times [2021-11-07 07:59:40,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:40,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016483313] [2021-11-07 07:59:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:40,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:41,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:41,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016483313] [2021-11-07 07:59:41,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016483313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:41,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:41,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:41,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195055463] [2021-11-07 07:59:41,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:41,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:41,009 INFO L87 Difference]: Start difference. First operand 745 states and 1303 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:41,211 INFO L93 Difference]: Finished difference Result 1387 states and 2448 transitions. [2021-11-07 07:59:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:41,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-11-07 07:59:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:41,222 INFO L225 Difference]: With dead ends: 1387 [2021-11-07 07:59:41,222 INFO L226 Difference]: Without dead ends: 1387 [2021-11-07 07:59:41,223 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2021-11-07 07:59:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1033. [2021-11-07 07:59:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.7220602526724975) internal successors, (1772), 1029 states have internal predecessors, (1772), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1775 transitions. [2021-11-07 07:59:41,259 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1775 transitions. Word has length 30 [2021-11-07 07:59:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:41,260 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1775 transitions. [2021-11-07 07:59:41,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1775 transitions. [2021-11-07 07:59:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 07:59:41,263 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:41,263 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:41,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 07:59:41,264 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:41,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1275693228, now seen corresponding path program 1 times [2021-11-07 07:59:41,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:41,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628940347] [2021-11-07 07:59:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:41,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:41,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:41,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:41,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628940347] [2021-11-07 07:59:41,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628940347] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:41,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:41,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:41,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762935475] [2021-11-07 07:59:41,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:41,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:41,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:41,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:41,357 INFO L87 Difference]: Start difference. First operand 1033 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:41,549 INFO L93 Difference]: Finished difference Result 1451 states and 2488 transitions. [2021-11-07 07:59:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:41,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-11-07 07:59:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:41,558 INFO L225 Difference]: With dead ends: 1451 [2021-11-07 07:59:41,558 INFO L226 Difference]: Without dead ends: 1451 [2021-11-07 07:59:41,559 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2021-11-07 07:59:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2021-11-07 07:59:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1445 states have (on average 1.719031141868512) internal successors, (2484), 1445 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2487 transitions. [2021-11-07 07:59:41,602 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2487 transitions. Word has length 30 [2021-11-07 07:59:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:41,603 INFO L470 AbstractCegarLoop]: Abstraction has 1449 states and 2487 transitions. [2021-11-07 07:59:41,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2487 transitions. [2021-11-07 07:59:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-07 07:59:41,605 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:41,605 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:41,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 07:59:41,606 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1714026023, now seen corresponding path program 1 times [2021-11-07 07:59:41,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:41,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658216790] [2021-11-07 07:59:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:41,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:41,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:41,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:41,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658216790] [2021-11-07 07:59:41,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658216790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:41,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:41,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:41,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921945926] [2021-11-07 07:59:41,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:41,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:41,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:41,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:41,683 INFO L87 Difference]: Start difference. First operand 1449 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:41,871 INFO L93 Difference]: Finished difference Result 1467 states and 2488 transitions. [2021-11-07 07:59:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-11-07 07:59:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:41,882 INFO L225 Difference]: With dead ends: 1467 [2021-11-07 07:59:41,883 INFO L226 Difference]: Without dead ends: 1467 [2021-11-07 07:59:41,885 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2021-11-07 07:59:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1465. [2021-11-07 07:59:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1461 states have (on average 1.700205338809035) internal successors, (2484), 1461 states have internal predecessors, (2484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2487 transitions. [2021-11-07 07:59:41,955 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2487 transitions. Word has length 31 [2021-11-07 07:59:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:41,956 INFO L470 AbstractCegarLoop]: Abstraction has 1465 states and 2487 transitions. [2021-11-07 07:59:41,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2487 transitions. [2021-11-07 07:59:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-07 07:59:41,959 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:41,959 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:41,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 07:59:41,960 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:41,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash 891997531, now seen corresponding path program 1 times [2021-11-07 07:59:41,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:41,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146770261] [2021-11-07 07:59:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:41,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:42,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:42,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146770261] [2021-11-07 07:59:42,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146770261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:42,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:42,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:42,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952796843] [2021-11-07 07:59:42,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:42,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:42,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:42,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:42,025 INFO L87 Difference]: Start difference. First operand 1465 states and 2487 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:42,245 INFO L93 Difference]: Finished difference Result 2699 states and 4632 transitions. [2021-11-07 07:59:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:42,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-11-07 07:59:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:42,264 INFO L225 Difference]: With dead ends: 2699 [2021-11-07 07:59:42,264 INFO L226 Difference]: Without dead ends: 2699 [2021-11-07 07:59:42,265 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2021-11-07 07:59:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2057. [2021-11-07 07:59:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.6619581100828056) internal successors, (3412), 2053 states have internal predecessors, (3412), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3415 transitions. [2021-11-07 07:59:42,351 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3415 transitions. Word has length 31 [2021-11-07 07:59:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:42,352 INFO L470 AbstractCegarLoop]: Abstraction has 2057 states and 3415 transitions. [2021-11-07 07:59:42,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3415 transitions. [2021-11-07 07:59:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-07 07:59:42,355 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:42,356 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:42,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 07:59:42,356 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:42,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1102147175, now seen corresponding path program 1 times [2021-11-07 07:59:42,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:42,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429544617] [2021-11-07 07:59:42,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:42,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:42,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:42,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:42,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429544617] [2021-11-07 07:59:42,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429544617] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:42,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:42,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:42,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311773241] [2021-11-07 07:59:42,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:42,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:42,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:42,438 INFO L87 Difference]: Start difference. First operand 2057 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:42,687 INFO L93 Difference]: Finished difference Result 2859 states and 4744 transitions. [2021-11-07 07:59:42,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-11-07 07:59:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:42,709 INFO L225 Difference]: With dead ends: 2859 [2021-11-07 07:59:42,709 INFO L226 Difference]: Without dead ends: 2859 [2021-11-07 07:59:42,709 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2021-11-07 07:59:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2021-11-07 07:59:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2853 states have (on average 1.6614090431125133) internal successors, (4740), 2853 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4743 transitions. [2021-11-07 07:59:42,811 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4743 transitions. Word has length 31 [2021-11-07 07:59:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:42,812 INFO L470 AbstractCegarLoop]: Abstraction has 2857 states and 4743 transitions. [2021-11-07 07:59:42,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4743 transitions. [2021-11-07 07:59:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 07:59:42,816 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:42,816 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:42,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 07:59:42,817 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1882333153, now seen corresponding path program 1 times [2021-11-07 07:59:42,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:42,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378910638] [2021-11-07 07:59:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:42,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:42,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:42,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378910638] [2021-11-07 07:59:42,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378910638] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:42,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:42,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:42,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779560228] [2021-11-07 07:59:42,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:42,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:42,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:42,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:42,872 INFO L87 Difference]: Start difference. First operand 2857 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:43,065 INFO L93 Difference]: Finished difference Result 2891 states and 4744 transitions. [2021-11-07 07:59:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:43,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-07 07:59:43,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:43,084 INFO L225 Difference]: With dead ends: 2891 [2021-11-07 07:59:43,084 INFO L226 Difference]: Without dead ends: 2891 [2021-11-07 07:59:43,085 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2021-11-07 07:59:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2889. [2021-11-07 07:59:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2885 states have (on average 1.6429809358752165) internal successors, (4740), 2885 states have internal predecessors, (4740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4743 transitions. [2021-11-07 07:59:43,192 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4743 transitions. Word has length 32 [2021-11-07 07:59:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:43,193 INFO L470 AbstractCegarLoop]: Abstraction has 2889 states and 4743 transitions. [2021-11-07 07:59:43,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4743 transitions. [2021-11-07 07:59:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 07:59:43,197 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:43,197 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:43,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 07:59:43,197 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash 193389411, now seen corresponding path program 1 times [2021-11-07 07:59:43,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:43,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599044326] [2021-11-07 07:59:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:43,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:43,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:43,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599044326] [2021-11-07 07:59:43,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599044326] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:43,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:43,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:43,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866027897] [2021-11-07 07:59:43,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:43,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:43,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:43,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:43,254 INFO L87 Difference]: Start difference. First operand 2889 states and 4743 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:43,454 INFO L93 Difference]: Finished difference Result 5259 states and 8744 transitions. [2021-11-07 07:59:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:43,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-07 07:59:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:43,484 INFO L225 Difference]: With dead ends: 5259 [2021-11-07 07:59:43,485 INFO L226 Difference]: Without dead ends: 5259 [2021-11-07 07:59:43,485 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2021-11-07 07:59:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4105. [2021-11-07 07:59:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.6005852231163131) internal successors, (6564), 4101 states have internal predecessors, (6564), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6567 transitions. [2021-11-07 07:59:43,626 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6567 transitions. Word has length 32 [2021-11-07 07:59:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:43,626 INFO L470 AbstractCegarLoop]: Abstraction has 4105 states and 6567 transitions. [2021-11-07 07:59:43,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6567 transitions. [2021-11-07 07:59:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 07:59:43,632 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:43,633 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:43,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 07:59:43,633 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1800755295, now seen corresponding path program 1 times [2021-11-07 07:59:43,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:43,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003766975] [2021-11-07 07:59:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:43,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:43,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:43,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003766975] [2021-11-07 07:59:43,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003766975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:43,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:43,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:43,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150782421] [2021-11-07 07:59:43,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:43,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:43,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:43,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:43,701 INFO L87 Difference]: Start difference. First operand 4105 states and 6567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:43,921 INFO L93 Difference]: Finished difference Result 5643 states and 9032 transitions. [2021-11-07 07:59:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-07 07:59:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:43,956 INFO L225 Difference]: With dead ends: 5643 [2021-11-07 07:59:43,964 INFO L226 Difference]: Without dead ends: 5643 [2021-11-07 07:59:43,965 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2021-11-07 07:59:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5641. [2021-11-07 07:59:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.6015611140677666) internal successors, (9028), 5637 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 9031 transitions. [2021-11-07 07:59:44,157 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 9031 transitions. Word has length 32 [2021-11-07 07:59:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:44,157 INFO L470 AbstractCegarLoop]: Abstraction has 5641 states and 9031 transitions. [2021-11-07 07:59:44,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 9031 transitions. [2021-11-07 07:59:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 07:59:44,165 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:44,165 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:44,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 07:59:44,166 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:44,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1700318254, now seen corresponding path program 1 times [2021-11-07 07:59:44,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:44,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585378942] [2021-11-07 07:59:44,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:44,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:44,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:44,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585378942] [2021-11-07 07:59:44,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585378942] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:44,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:44,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:44,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100866453] [2021-11-07 07:59:44,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:44,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:44,225 INFO L87 Difference]: Start difference. First operand 5641 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:44,446 INFO L93 Difference]: Finished difference Result 5707 states and 9032 transitions. [2021-11-07 07:59:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:44,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-11-07 07:59:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:44,462 INFO L225 Difference]: With dead ends: 5707 [2021-11-07 07:59:44,462 INFO L226 Difference]: Without dead ends: 5707 [2021-11-07 07:59:44,462 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2021-11-07 07:59:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5705. [2021-11-07 07:59:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5701 states have (on average 1.5835818277495177) internal successors, (9028), 5701 states have internal predecessors, (9028), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 9031 transitions. [2021-11-07 07:59:44,621 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 9031 transitions. Word has length 33 [2021-11-07 07:59:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:44,622 INFO L470 AbstractCegarLoop]: Abstraction has 5705 states and 9031 transitions. [2021-11-07 07:59:44,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 9031 transitions. [2021-11-07 07:59:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 07:59:44,631 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:44,631 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:44,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 07:59:44,631 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:44,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash 11374512, now seen corresponding path program 1 times [2021-11-07 07:59:44,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:44,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538903431] [2021-11-07 07:59:44,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:44,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:44,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:44,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538903431] [2021-11-07 07:59:44,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538903431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:44,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:44,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:44,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411812532] [2021-11-07 07:59:44,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:44,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:44,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:44,691 INFO L87 Difference]: Start difference. First operand 5705 states and 9031 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:44,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:44,916 INFO L93 Difference]: Finished difference Result 10251 states and 16456 transitions. [2021-11-07 07:59:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-11-07 07:59:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:44,978 INFO L225 Difference]: With dead ends: 10251 [2021-11-07 07:59:44,978 INFO L226 Difference]: Without dead ends: 10251 [2021-11-07 07:59:44,979 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2021-11-07 07:59:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8201. [2021-11-07 07:59:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.5386116872026352) internal successors, (12612), 8197 states have internal predecessors, (12612), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 12615 transitions. [2021-11-07 07:59:45,184 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 12615 transitions. Word has length 33 [2021-11-07 07:59:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:45,185 INFO L470 AbstractCegarLoop]: Abstraction has 8201 states and 12615 transitions. [2021-11-07 07:59:45,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 12615 transitions. [2021-11-07 07:59:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 07:59:45,198 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:45,198 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:45,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 07:59:45,198 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1982770194, now seen corresponding path program 1 times [2021-11-07 07:59:45,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:45,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29226062] [2021-11-07 07:59:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:45,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:45,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:45,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29226062] [2021-11-07 07:59:45,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29226062] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:45,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:45,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:45,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067848953] [2021-11-07 07:59:45,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:45,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:45,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:45,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:45,255 INFO L87 Difference]: Start difference. First operand 8201 states and 12615 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:45,453 INFO L93 Difference]: Finished difference Result 11147 states and 17160 transitions. [2021-11-07 07:59:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-11-07 07:59:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:45,477 INFO L225 Difference]: With dead ends: 11147 [2021-11-07 07:59:45,477 INFO L226 Difference]: Without dead ends: 11147 [2021-11-07 07:59:45,477 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2021-11-07 07:59:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 11145. [2021-11-07 07:59:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11145 states, 11141 states have (on average 1.5398976752535678) internal successors, (17156), 11141 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11145 states to 11145 states and 17159 transitions. [2021-11-07 07:59:45,771 INFO L78 Accepts]: Start accepts. Automaton has 11145 states and 17159 transitions. Word has length 33 [2021-11-07 07:59:45,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:45,771 INFO L470 AbstractCegarLoop]: Abstraction has 11145 states and 17159 transitions. [2021-11-07 07:59:45,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 11145 states and 17159 transitions. [2021-11-07 07:59:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-07 07:59:45,786 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:45,786 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:45,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 07:59:45,786 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 352824022, now seen corresponding path program 1 times [2021-11-07 07:59:45,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:45,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050310770] [2021-11-07 07:59:45,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:45,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:45,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:45,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050310770] [2021-11-07 07:59:45,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050310770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:45,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:45,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:45,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486259695] [2021-11-07 07:59:45,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:45,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:45,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:45,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:45,844 INFO L87 Difference]: Start difference. First operand 11145 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:46,154 INFO L93 Difference]: Finished difference Result 11275 states and 17160 transitions. [2021-11-07 07:59:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:46,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-11-07 07:59:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:46,181 INFO L225 Difference]: With dead ends: 11275 [2021-11-07 07:59:46,181 INFO L226 Difference]: Without dead ends: 11275 [2021-11-07 07:59:46,182 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2021-11-07 07:59:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11273. [2021-11-07 07:59:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.5224066021829799) internal successors, (17156), 11269 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 17159 transitions. [2021-11-07 07:59:46,470 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 17159 transitions. Word has length 34 [2021-11-07 07:59:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:46,471 INFO L470 AbstractCegarLoop]: Abstraction has 11273 states and 17159 transitions. [2021-11-07 07:59:46,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 17159 transitions. [2021-11-07 07:59:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-07 07:59:46,485 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:46,485 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:46,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 07:59:46,485 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1336119720, now seen corresponding path program 1 times [2021-11-07 07:59:46,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:46,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190983266] [2021-11-07 07:59:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:46,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:46,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:46,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:46,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190983266] [2021-11-07 07:59:46,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190983266] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:46,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:46,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:46,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200631078] [2021-11-07 07:59:46,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:46,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:46,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:46,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:46,536 INFO L87 Difference]: Start difference. First operand 11273 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:46,847 INFO L93 Difference]: Finished difference Result 19979 states and 30856 transitions. [2021-11-07 07:59:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:46,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-11-07 07:59:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:46,895 INFO L225 Difference]: With dead ends: 19979 [2021-11-07 07:59:46,896 INFO L226 Difference]: Without dead ends: 19979 [2021-11-07 07:59:46,896 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19979 states. [2021-11-07 07:59:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19979 to 16393. [2021-11-07 07:59:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16393 states, 16389 states have (on average 1.4763560925010677) internal successors, (24196), 16389 states have internal predecessors, (24196), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 24199 transitions. [2021-11-07 07:59:47,347 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 24199 transitions. Word has length 34 [2021-11-07 07:59:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:47,347 INFO L470 AbstractCegarLoop]: Abstraction has 16393 states and 24199 transitions. [2021-11-07 07:59:47,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 24199 transitions. [2021-11-07 07:59:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-07 07:59:47,371 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:47,372 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:47,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 07:59:47,372 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash 964702870, now seen corresponding path program 1 times [2021-11-07 07:59:47,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:47,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975703545] [2021-11-07 07:59:47,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:47,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:47,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:47,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975703545] [2021-11-07 07:59:47,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975703545] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:47,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:47,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:47,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689618612] [2021-11-07 07:59:47,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:47,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:47,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:47,425 INFO L87 Difference]: Start difference. First operand 16393 states and 24199 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:47,657 INFO L93 Difference]: Finished difference Result 22027 states and 32520 transitions. [2021-11-07 07:59:47,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:47,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-11-07 07:59:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:47,710 INFO L225 Difference]: With dead ends: 22027 [2021-11-07 07:59:47,710 INFO L226 Difference]: Without dead ends: 22027 [2021-11-07 07:59:47,710 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22027 states. [2021-11-07 07:59:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22027 to 22025. [2021-11-07 07:59:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22025 states, 22021 states have (on average 1.4765905272240134) internal successors, (32516), 22021 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22025 states to 22025 states and 32519 transitions. [2021-11-07 07:59:48,381 INFO L78 Accepts]: Start accepts. Automaton has 22025 states and 32519 transitions. Word has length 34 [2021-11-07 07:59:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:48,382 INFO L470 AbstractCegarLoop]: Abstraction has 22025 states and 32519 transitions. [2021-11-07 07:59:48,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 22025 states and 32519 transitions. [2021-11-07 07:59:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-07 07:59:48,407 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:48,407 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:48,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 07:59:48,408 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1530176131, now seen corresponding path program 1 times [2021-11-07 07:59:48,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:48,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315768786] [2021-11-07 07:59:48,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:48,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:48,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:48,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315768786] [2021-11-07 07:59:48,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315768786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:48,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:48,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:48,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957202616] [2021-11-07 07:59:48,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:48,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:48,469 INFO L87 Difference]: Start difference. First operand 22025 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:48,830 INFO L93 Difference]: Finished difference Result 22283 states and 32520 transitions. [2021-11-07 07:59:48,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:48,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-11-07 07:59:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:48,914 INFO L225 Difference]: With dead ends: 22283 [2021-11-07 07:59:48,914 INFO L226 Difference]: Without dead ends: 22283 [2021-11-07 07:59:48,915 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22283 states. [2021-11-07 07:59:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22283 to 22281. [2021-11-07 07:59:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22281 states, 22277 states have (on average 1.4596220316918795) internal successors, (32516), 22277 states have internal predecessors, (32516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22281 states to 22281 states and 32519 transitions. [2021-11-07 07:59:49,344 INFO L78 Accepts]: Start accepts. Automaton has 22281 states and 32519 transitions. Word has length 35 [2021-11-07 07:59:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:49,345 INFO L470 AbstractCegarLoop]: Abstraction has 22281 states and 32519 transitions. [2021-11-07 07:59:49,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22281 states and 32519 transitions. [2021-11-07 07:59:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-07 07:59:49,366 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:49,366 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:49,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 07:59:49,367 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash -158767611, now seen corresponding path program 1 times [2021-11-07 07:59:49,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:49,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194377787] [2021-11-07 07:59:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:49,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:49,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:49,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194377787] [2021-11-07 07:59:49,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194377787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:49,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:49,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:49,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146422949] [2021-11-07 07:59:49,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:49,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:49,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:49,415 INFO L87 Difference]: Start difference. First operand 22281 states and 32519 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:49,804 INFO L93 Difference]: Finished difference Result 43531 states and 61960 transitions. [2021-11-07 07:59:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:49,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-11-07 07:59:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:49,875 INFO L225 Difference]: With dead ends: 43531 [2021-11-07 07:59:49,875 INFO L226 Difference]: Without dead ends: 43531 [2021-11-07 07:59:49,875 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43531 states. [2021-11-07 07:59:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43531 to 43529. [2021-11-07 07:59:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43529 states, 43525 states have (on average 1.4234577828834003) internal successors, (61956), 43525 states have internal predecessors, (61956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43529 states to 43529 states and 61959 transitions. [2021-11-07 07:59:50,828 INFO L78 Accepts]: Start accepts. Automaton has 43529 states and 61959 transitions. Word has length 35 [2021-11-07 07:59:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:50,829 INFO L470 AbstractCegarLoop]: Abstraction has 43529 states and 61959 transitions. [2021-11-07 07:59:50,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 43529 states and 61959 transitions. [2021-11-07 07:59:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-07 07:59:50,860 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:50,861 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:50,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 07:59:50,861 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1835377095, now seen corresponding path program 1 times [2021-11-07 07:59:50,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:50,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784514916] [2021-11-07 07:59:50,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:50,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:50,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:50,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:50,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784514916] [2021-11-07 07:59:50,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784514916] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:50,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:50,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:50,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299353658] [2021-11-07 07:59:50,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:50,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:50,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:50,914 INFO L87 Difference]: Start difference. First operand 43529 states and 61959 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:51,416 INFO L93 Difference]: Finished difference Result 49675 states and 72712 transitions. [2021-11-07 07:59:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:51,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-11-07 07:59:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:51,493 INFO L225 Difference]: With dead ends: 49675 [2021-11-07 07:59:51,493 INFO L226 Difference]: Without dead ends: 49675 [2021-11-07 07:59:51,493 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49675 states. [2021-11-07 07:59:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49675 to 43529. [2021-11-07 07:59:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43529 states, 43525 states have (on average 1.411694428489374) internal successors, (61444), 43525 states have internal predecessors, (61444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43529 states to 43529 states and 61447 transitions. [2021-11-07 07:59:52,360 INFO L78 Accepts]: Start accepts. Automaton has 43529 states and 61447 transitions. Word has length 35 [2021-11-07 07:59:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:52,361 INFO L470 AbstractCegarLoop]: Abstraction has 43529 states and 61447 transitions. [2021-11-07 07:59:52,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 43529 states and 61447 transitions. [2021-11-07 07:59:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 07:59:52,405 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:52,405 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:52,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 07:59:52,406 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:52,406 INFO L85 PathProgramCache]: Analyzing trace with hash -626613813, now seen corresponding path program 1 times [2021-11-07 07:59:52,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:52,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769528653] [2021-11-07 07:59:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:52,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:52,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:52,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:52,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769528653] [2021-11-07 07:59:52,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769528653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:52,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:52,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:52,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196802494] [2021-11-07 07:59:52,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:52,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:52,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:52,459 INFO L87 Difference]: Start difference. First operand 43529 states and 61447 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:52,852 INFO L93 Difference]: Finished difference Result 75275 states and 107528 transitions. [2021-11-07 07:59:52,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:52,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-11-07 07:59:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:53,177 INFO L225 Difference]: With dead ends: 75275 [2021-11-07 07:59:53,177 INFO L226 Difference]: Without dead ends: 75275 [2021-11-07 07:59:53,178 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75275 states. [2021-11-07 07:59:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75275 to 65033. [2021-11-07 07:59:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65033 states, 65029 states have (on average 1.3700349075028064) internal successors, (89092), 65029 states have internal predecessors, (89092), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65033 states to 65033 states and 89095 transitions. [2021-11-07 07:59:54,144 INFO L78 Accepts]: Start accepts. Automaton has 65033 states and 89095 transitions. Word has length 36 [2021-11-07 07:59:54,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:54,147 INFO L470 AbstractCegarLoop]: Abstraction has 65033 states and 89095 transitions. [2021-11-07 07:59:54,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 65033 states and 89095 transitions. [2021-11-07 07:59:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 07:59:54,425 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:54,425 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:54,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 07:59:54,425 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:54,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:54,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1674208777, now seen corresponding path program 1 times [2021-11-07 07:59:54,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:54,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462276761] [2021-11-07 07:59:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:54,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:54,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:54,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:54,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462276761] [2021-11-07 07:59:54,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462276761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:54,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:54,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:54,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262747990] [2021-11-07 07:59:54,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:54,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:54,491 INFO L87 Difference]: Start difference. First operand 65033 states and 89095 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:54,960 INFO L93 Difference]: Finished difference Result 85515 states and 116744 transitions. [2021-11-07 07:59:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:54,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-11-07 07:59:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:55,084 INFO L225 Difference]: With dead ends: 85515 [2021-11-07 07:59:55,085 INFO L226 Difference]: Without dead ends: 85515 [2021-11-07 07:59:55,085 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85515 states. [2021-11-07 07:59:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85515 to 85513. [2021-11-07 07:59:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85513 states, 85509 states have (on average 1.3652364078634998) internal successors, (116740), 85509 states have internal predecessors, (116740), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85513 states to 85513 states and 116743 transitions. [2021-11-07 07:59:56,813 INFO L78 Accepts]: Start accepts. Automaton has 85513 states and 116743 transitions. Word has length 36 [2021-11-07 07:59:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:56,813 INFO L470 AbstractCegarLoop]: Abstraction has 85513 states and 116743 transitions. [2021-11-07 07:59:56,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 85513 states and 116743 transitions. [2021-11-07 07:59:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 07:59:56,893 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:56,893 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:56,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 07:59:56,894 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:56,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2050023450, now seen corresponding path program 1 times [2021-11-07 07:59:56,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:56,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098486025] [2021-11-07 07:59:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:56,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:56,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:56,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098486025] [2021-11-07 07:59:56,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098486025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:56,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:56,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:56,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930564350] [2021-11-07 07:59:56,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:56,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:56,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:56,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:56,954 INFO L87 Difference]: Start difference. First operand 85513 states and 116743 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:57,371 INFO L93 Difference]: Finished difference Result 87051 states and 117768 transitions. [2021-11-07 07:59:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-11-07 07:59:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:59:57,477 INFO L225 Difference]: With dead ends: 87051 [2021-11-07 07:59:57,477 INFO L226 Difference]: Without dead ends: 87051 [2021-11-07 07:59:57,478 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:59:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87051 states. [2021-11-07 07:59:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87051 to 87049. [2021-11-07 07:59:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87049 states, 87045 states have (on average 1.3529094146705727) internal successors, (117764), 87045 states have internal predecessors, (117764), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87049 states to 87049 states and 117767 transitions. [2021-11-07 07:59:59,303 INFO L78 Accepts]: Start accepts. Automaton has 87049 states and 117767 transitions. Word has length 37 [2021-11-07 07:59:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:59:59,304 INFO L470 AbstractCegarLoop]: Abstraction has 87049 states and 117767 transitions. [2021-11-07 07:59:59,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87049 states and 117767 transitions. [2021-11-07 07:59:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 07:59:59,361 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:59:59,361 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:59:59,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 07:59:59,362 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 07:59:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:59:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash 361079708, now seen corresponding path program 1 times [2021-11-07 07:59:59,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:59:59,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10665646] [2021-11-07 07:59:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:59:59,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:59:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 07:59:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:59:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:59:59,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:59:59,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10665646] [2021-11-07 07:59:59,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10665646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:59:59,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:59:59,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 07:59:59,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949860471] [2021-11-07 07:59:59,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 07:59:59,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:59:59,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 07:59:59,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 07:59:59,416 INFO L87 Difference]: Start difference. First operand 87049 states and 117767 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:59:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:59:59,979 INFO L93 Difference]: Finished difference Result 147467 states and 200712 transitions. [2021-11-07 07:59:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 07:59:59,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-11-07 07:59:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:00:00,204 INFO L225 Difference]: With dead ends: 147467 [2021-11-07 08:00:00,204 INFO L226 Difference]: Without dead ends: 147467 [2021-11-07 08:00:00,205 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:00:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147467 states. [2021-11-07 08:00:02,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147467 to 131081. [2021-11-07 08:00:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131081 states, 131077 states have (on average 1.312480450422271) internal successors, (172036), 131077 states have internal predecessors, (172036), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131081 states to 131081 states and 172039 transitions. [2021-11-07 08:00:02,757 INFO L78 Accepts]: Start accepts. Automaton has 131081 states and 172039 transitions. Word has length 37 [2021-11-07 08:00:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:00:02,757 INFO L470 AbstractCegarLoop]: Abstraction has 131081 states and 172039 transitions. [2021-11-07 08:00:02,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 131081 states and 172039 transitions. [2021-11-07 08:00:02,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 08:00:02,845 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:00:02,845 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:00:02,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 08:00:02,846 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:00:02,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:00:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1633064998, now seen corresponding path program 1 times [2021-11-07 08:00:02,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:00:02,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655666590] [2021-11-07 08:00:02,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:00:02,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:00:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:00:02,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:00:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:00:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:00:02,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:00:02,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655666590] [2021-11-07 08:00:02,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655666590] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:00:02,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:00:02,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:00:02,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638408318] [2021-11-07 08:00:02,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:00:02,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:00:02,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:00:02,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:00:02,901 INFO L87 Difference]: Start difference. First operand 131081 states and 172039 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:00:04,090 INFO L93 Difference]: Finished difference Result 169995 states and 221192 transitions. [2021-11-07 08:00:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:00:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-11-07 08:00:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:00:04,427 INFO L225 Difference]: With dead ends: 169995 [2021-11-07 08:00:04,427 INFO L226 Difference]: Without dead ends: 169995 [2021-11-07 08:00:04,428 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:00:04,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169995 states. [2021-11-07 08:00:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169995 to 169993. [2021-11-07 08:00:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169993 states, 169989 states have (on average 1.3011900770049827) internal successors, (221188), 169989 states have internal predecessors, (221188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169993 states to 169993 states and 221191 transitions. [2021-11-07 08:00:07,076 INFO L78 Accepts]: Start accepts. Automaton has 169993 states and 221191 transitions. Word has length 37 [2021-11-07 08:00:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:00:07,077 INFO L470 AbstractCegarLoop]: Abstraction has 169993 states and 221191 transitions. [2021-11-07 08:00:07,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 169993 states and 221191 transitions. [2021-11-07 08:00:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:00:07,200 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:00:07,200 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:00:07,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 08:00:07,201 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:00:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:00:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1691215426, now seen corresponding path program 1 times [2021-11-07 08:00:07,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:00:07,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596478490] [2021-11-07 08:00:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:00:07,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:00:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:00:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:00:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:00:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:00:07,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:00:07,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596478490] [2021-11-07 08:00:07,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596478490] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:00:07,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:00:07,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:00:07,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241660518] [2021-11-07 08:00:07,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:00:07,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:00:07,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:00:07,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:00:07,253 INFO L87 Difference]: Start difference. First operand 169993 states and 221191 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:00:07,979 INFO L93 Difference]: Finished difference Result 172043 states and 221192 transitions. [2021-11-07 08:00:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:00:07,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-11-07 08:00:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:00:08,237 INFO L225 Difference]: With dead ends: 172043 [2021-11-07 08:00:08,237 INFO L226 Difference]: Without dead ends: 172043 [2021-11-07 08:00:08,238 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:00:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172043 states. [2021-11-07 08:00:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172043 to 172041. [2021-11-07 08:00:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172041 states, 172037 states have (on average 1.2857001691496597) internal successors, (221188), 172037 states have internal predecessors, (221188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172041 states to 172041 states and 221191 transitions. [2021-11-07 08:00:11,231 INFO L78 Accepts]: Start accepts. Automaton has 172041 states and 221191 transitions. Word has length 38 [2021-11-07 08:00:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:00:11,231 INFO L470 AbstractCegarLoop]: Abstraction has 172041 states and 221191 transitions. [2021-11-07 08:00:11,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 172041 states and 221191 transitions. [2021-11-07 08:00:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:00:11,936 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:00:11,937 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:00:11,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 08:00:11,937 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:00:11,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:00:11,942 INFO L85 PathProgramCache]: Analyzing trace with hash 914808128, now seen corresponding path program 1 times [2021-11-07 08:00:11,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:00:11,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409892244] [2021-11-07 08:00:11,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:00:11,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:00:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:00:12,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:00:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:00: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. [2021-11-07 08:00:12,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:00:12,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409892244] [2021-11-07 08:00:12,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409892244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:00:12,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:00:12,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:00:12,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115725960] [2021-11-07 08:00:12,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:00:12,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:00:12,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:00:12,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:00:12,036 INFO L87 Difference]: Start difference. First operand 172041 states and 221191 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:00:13,124 INFO L93 Difference]: Finished difference Result 286731 states and 368648 transitions. [2021-11-07 08:00:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:00:13,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-11-07 08:00:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:00:13,483 INFO L225 Difference]: With dead ends: 286731 [2021-11-07 08:00:13,484 INFO L226 Difference]: Without dead ends: 286731 [2021-11-07 08:00:13,484 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:00:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286731 states. [2021-11-07 08:00:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286731 to 262153. [2021-11-07 08:00:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262153 states, 262149 states have (on average 1.2499914170948583) internal successors, (327684), 262149 states have internal predecessors, (327684), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262153 states to 262153 states and 327687 transitions. [2021-11-07 08:00:18,282 INFO L78 Accepts]: Start accepts. Automaton has 262153 states and 327687 transitions. Word has length 38 [2021-11-07 08:00:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:00:18,283 INFO L470 AbstractCegarLoop]: Abstraction has 262153 states and 327687 transitions. [2021-11-07 08:00:18,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 262153 states and 327687 transitions. [2021-11-07 08:00:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:00:18,456 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:00:18,456 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:00:18,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 08:00:18,456 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:00:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:00:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1079336578, now seen corresponding path program 1 times [2021-11-07 08:00:18,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:00:18,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168659569] [2021-11-07 08:00:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:00:18,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:00:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:00:18,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:00:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:00:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:00:18,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:00:18,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168659569] [2021-11-07 08:00:18,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168659569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:00:18,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:00:18,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:00:18,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757716459] [2021-11-07 08:00:18,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:00:18,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:00:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:00:18,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:00:18,506 INFO L87 Difference]: Start difference. First operand 262153 states and 327687 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 08:00:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:00:20,568 INFO L93 Difference]: Finished difference Result 335883 states and 413704 transitions. [2021-11-07 08:00:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:00:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-11-07 08:00:20,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:00:20,962 INFO L225 Difference]: With dead ends: 335883 [2021-11-07 08:00:20,962 INFO L226 Difference]: Without dead ends: 335883 [2021-11-07 08:00:20,963 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:00:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335883 states.