./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:39:58,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:39:58,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:39:58,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:39:58,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:39:58,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:39:58,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:39:58,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:39:58,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:39:58,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:39:58,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:39:58,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:39:58,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:39:58,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:39:58,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:39:58,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:39:58,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:39:58,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:39:58,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:39:58,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:39:58,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:39:58,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:39:58,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:39:58,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:39:58,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:39:58,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:39:58,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:39:58,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:39:58,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:39:58,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:39:58,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:39:58,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:39:58,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:39:58,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:39:58,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:39:58,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:39:58,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:39:58,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:39:58,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:39:58,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:39:58,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:39:58,746 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-10-28 23:39:58,798 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:39:58,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:39:58,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:39:58,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:39:58,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:39:58,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:39:58,810 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:39:58,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:39:58,811 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:39:58,811 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 23:39:58,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:39:58,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:39:58,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:39:58,814 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-28 23:39:58,814 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-28 23:39:58,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:39:58,814 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-28 23:39:58,815 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:39:58,815 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:39:58,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:39:58,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:39:58,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:39:58,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:39:58,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:39:58,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:39:58,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:39:58,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:39:58,818 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:39:58,818 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_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/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_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD 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-memcleanup) ) 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2021-10-28 23:39:59,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:39:59,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:39:59,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:39:59,236 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:39:59,238 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:39:59,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-10-28 23:39:59,336 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/data/16e8f5ef8/e287b53e163644abb9ebcabe9bc9a0ad/FLAGc70b20b81 [2021-10-28 23:40:00,025 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:40:00,025 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-10-28 23:40:00,044 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/data/16e8f5ef8/e287b53e163644abb9ebcabe9bc9a0ad/FLAGc70b20b81 [2021-10-28 23:40:00,265 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/data/16e8f5ef8/e287b53e163644abb9ebcabe9bc9a0ad [2021-10-28 23:40:00,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:40:00,270 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-28 23:40:00,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:40:00,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:40:00,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:40:00,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:00,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f085d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00, skipping insertion in model container [2021-10-28 23:40:00,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:00,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:40:00,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:40:00,711 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_2105bb47-1f19-49b1-9ef7-4d10661f991c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-10-28 23:40:00,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:40:00,758 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:40:00,801 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_2105bb47-1f19-49b1-9ef7-4d10661f991c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-10-28 23:40:00,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:40:00,903 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:40:00,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00 WrapperNode [2021-10-28 23:40:00,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:40:00,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:40:00,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:40:00,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:40:00,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:00,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:00,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:00,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:01,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:01,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:01,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:01,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:40:01,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:40:01,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:40:01,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:40:01,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00" (1/1) ... [2021-10-28 23:40:01,066 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:40:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:40:01,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:40:01,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:40:01,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-28 23:40:01,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:40:01,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-28 23:40:01,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-10-28 23:40:01,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-10-28 23:40:01,154 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-10-28 23:40:01,155 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-10-28 23:40:01,156 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2021-10-28 23:40:01,156 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2021-10-28 23:40:01,156 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2021-10-28 23:40:01,157 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2021-10-28 23:40:01,157 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-28 23:40:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-28 23:40:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-28 23:40:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-28 23:40:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-28 23:40:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-28 23:40:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:40:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-10-28 23:40:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-10-28 23:40:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-28 23:40:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-28 23:40:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-28 23:40:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-28 23:40:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-28 23:40:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-28 23:40:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-28 23:40:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-28 23:40:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-28 23:40:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-28 23:40:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-28 23:40:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-28 23:40:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-28 23:40:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-28 23:40:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-28 23:40:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-28 23:40:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-28 23:40:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-28 23:40:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-28 23:40:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-28 23:40:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-28 23:40:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-28 23:40:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-28 23:40:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-28 23:40:01,165 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-28 23:40:01,166 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-28 23:40:01,166 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-28 23:40:01,166 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-28 23:40:01,167 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-28 23:40:01,167 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-28 23:40:01,168 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-28 23:40:01,168 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-28 23:40:01,168 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-28 23:40:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-28 23:40:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-28 23:40:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-28 23:40:01,170 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-28 23:40:01,170 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-28 23:40:01,170 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-28 23:40:01,170 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-28 23:40:01,170 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-28 23:40:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-28 23:40:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-28 23:40:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-28 23:40:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-28 23:40:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-28 23:40:01,172 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-28 23:40:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-28 23:40:01,174 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-28 23:40:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-28 23:40:01,175 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-28 23:40:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-28 23:40:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-28 23:40:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-28 23:40:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-28 23:40:01,176 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-28 23:40:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-28 23:40:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-28 23:40:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-28 23:40:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-28 23:40:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-28 23:40:01,178 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-28 23:40:01,178 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-28 23:40:01,178 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-28 23:40:01,178 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-28 23:40:01,178 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-28 23:40:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-28 23:40:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-28 23:40:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-28 23:40:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-28 23:40:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-28 23:40:01,180 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-28 23:40:01,180 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-28 23:40:01,180 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-28 23:40:01,180 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-28 23:40:01,180 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-28 23:40:01,181 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-28 23:40:01,181 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-28 23:40:01,181 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-28 23:40:01,181 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-28 23:40:01,181 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-28 23:40:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-28 23:40:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-28 23:40:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-28 23:40:01,182 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-28 23:40:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-28 23:40:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-28 23:40:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-28 23:40:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-28 23:40:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-28 23:40:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-28 23:40:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-28 23:40:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-28 23:40:01,186 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-28 23:40:01,186 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-28 23:40:01,186 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-28 23:40:01,186 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-28 23:40:01,186 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-28 23:40:01,187 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-28 23:40:01,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-28 23:40:01,187 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-10-28 23:40:01,187 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-10-28 23:40:01,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-28 23:40:01,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-28 23:40:01,188 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2021-10-28 23:40:01,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 23:40:01,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 23:40:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2021-10-28 23:40:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2021-10-28 23:40:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2021-10-28 23:40:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-28 23:40:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 23:40:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 23:40:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-28 23:40:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:40:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:40:02,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:40:02,326 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2021-10-28 23:40:02,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:40:02 BoogieIcfgContainer [2021-10-28 23:40:02,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:40:02,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:40:02,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:40:02,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:40:02,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:40:00" (1/3) ... [2021-10-28 23:40:02,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7731d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:40:02, skipping insertion in model container [2021-10-28 23:40:02,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:40:00" (2/3) ... [2021-10-28 23:40:02,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7731d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:40:02, skipping insertion in model container [2021-10-28 23:40:02,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:40:02" (3/3) ... [2021-10-28 23:40:02,340 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-10-28 23:40:02,346 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:40:02,347 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2021-10-28 23:40:02,403 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:40:02,411 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-10-28 23:40:02,411 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2021-10-28 23:40:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 144 states have (on average 2.1527777777777777) internal successors, (310), 265 states have internal predecessors, (310), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2021-10-28 23:40:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-28 23:40:02,449 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:02,449 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:02,450 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr20ENSURES_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash -774541734, now seen corresponding path program 1 times [2021-10-28 23:40:02,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:02,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326047913] [2021-10-28 23:40:02,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:02,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:02,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:02,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:02,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326047913] [2021-10-28 23:40:02,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326047913] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:02,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:02,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:40:02,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915170521] [2021-10-28 23:40:02,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:40:02,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:40:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:40:02,703 INFO L87 Difference]: Start difference. First operand has 279 states, 144 states have (on average 2.1527777777777777) internal successors, (310), 265 states have internal predecessors, (310), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) 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-10-28 23:40:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:03,386 INFO L93 Difference]: Finished difference Result 320 states and 355 transitions. [2021-10-28 23:40:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:40:03,389 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-10-28 23:40:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:03,415 INFO L225 Difference]: With dead ends: 320 [2021-10-28 23:40:03,415 INFO L226 Difference]: Without dead ends: 315 [2021-10-28 23:40:03,418 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-10-28 23:40:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-10-28 23:40:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 277. [2021-10-28 23:40:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 145 states have (on average 1.896551724137931) internal successors, (275), 264 states have internal predecessors, (275), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-28 23:40:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2021-10-28 23:40:03,512 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2021-10-28 23:40:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:03,513 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2021-10-28 23:40:03,514 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-10-28 23:40:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2021-10-28 23:40:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-28 23:40:03,515 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:03,515 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:03,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:40:03,516 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1757963271, now seen corresponding path program 1 times [2021-10-28 23:40:03,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:03,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33424985] [2021-10-28 23:40:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:03,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:03,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:03,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33424985] [2021-10-28 23:40:03,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33424985] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:03,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:03,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:40:03,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846071572] [2021-10-28 23:40:03,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:40:03,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:03,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:40:03,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:40:03,664 INFO L87 Difference]: Start difference. First operand 277 states and 303 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-28 23:40:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:04,478 INFO L93 Difference]: Finished difference Result 332 states and 369 transitions. [2021-10-28 23:40:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:40:04,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2021-10-28 23:40:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:04,481 INFO L225 Difference]: With dead ends: 332 [2021-10-28 23:40:04,482 INFO L226 Difference]: Without dead ends: 332 [2021-10-28 23:40:04,482 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:40:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-10-28 23:40:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 275. [2021-10-28 23:40:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 145 states have (on average 1.8827586206896552) internal successors, (273), 262 states have internal predecessors, (273), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-28 23:40:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2021-10-28 23:40:04,503 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 10 [2021-10-28 23:40:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:04,504 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2021-10-28 23:40:04,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-28 23:40:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2021-10-28 23:40:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-28 23:40:04,505 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:04,506 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:04,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 23:40:04,506 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1757963272, now seen corresponding path program 1 times [2021-10-28 23:40:04,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:04,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211254648] [2021-10-28 23:40:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:04,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:04,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:04,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211254648] [2021-10-28 23:40:04,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211254648] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:04,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:04,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:40:04,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541979314] [2021-10-28 23:40:04,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:40:04,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:04,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:40:04,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:40:04,637 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-28 23:40:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:05,265 INFO L93 Difference]: Finished difference Result 342 states and 380 transitions. [2021-10-28 23:40:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:40:05,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2021-10-28 23:40:05,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:05,268 INFO L225 Difference]: With dead ends: 342 [2021-10-28 23:40:05,269 INFO L226 Difference]: Without dead ends: 342 [2021-10-28 23:40:05,269 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:40:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-10-28 23:40:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 273. [2021-10-28 23:40:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 145 states have (on average 1.8689655172413793) internal successors, (271), 260 states have internal predecessors, (271), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-28 23:40:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2021-10-28 23:40:05,289 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 10 [2021-10-28 23:40:05,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:05,289 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2021-10-28 23:40:05,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-28 23:40:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2021-10-28 23:40:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-28 23:40:05,291 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:05,291 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:05,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 23:40:05,292 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:05,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash 389021379, now seen corresponding path program 1 times [2021-10-28 23:40:05,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:05,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777117471] [2021-10-28 23:40:05,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:05,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:05,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-10-28 23:40:05,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:05,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777117471] [2021-10-28 23:40:05,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777117471] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:05,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:05,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:40:05,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684644736] [2021-10-28 23:40:05,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:40:05,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:40:05,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:40:05,414 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:05,994 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2021-10-28 23:40:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:40:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-10-28 23:40:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:05,997 INFO L225 Difference]: With dead ends: 308 [2021-10-28 23:40:05,997 INFO L226 Difference]: Without dead ends: 307 [2021-10-28 23:40:05,997 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:40:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-10-28 23:40:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2021-10-28 23:40:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 144 states have (on average 1.8680555555555556) internal successors, (269), 259 states have internal predecessors, (269), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-28 23:40:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2021-10-28 23:40:06,008 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 14 [2021-10-28 23:40:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:06,008 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2021-10-28 23:40:06,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2021-10-28 23:40:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 23:40:06,010 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:06,010 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:06,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 23:40:06,010 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:06,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1684555217, now seen corresponding path program 1 times [2021-10-28 23:40:06,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:06,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208240492] [2021-10-28 23:40:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:06,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:06,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:06,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:06,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208240492] [2021-10-28 23:40:06,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208240492] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:06,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:06,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:40:06,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783622904] [2021-10-28 23:40:06,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:40:06,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:40:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:40:06,082 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-28 23:40:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:06,682 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2021-10-28 23:40:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:40:06,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2021-10-28 23:40:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:06,686 INFO L225 Difference]: With dead ends: 314 [2021-10-28 23:40:06,686 INFO L226 Difference]: Without dead ends: 314 [2021-10-28 23:40:06,686 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:40:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-28 23:40:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2021-10-28 23:40:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 144 states have (on average 1.8541666666666667) internal successors, (267), 257 states have internal predecessors, (267), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-28 23:40:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2021-10-28 23:40:06,708 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 15 [2021-10-28 23:40:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:06,708 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2021-10-28 23:40:06,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-28 23:40:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2021-10-28 23:40:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 23:40:06,709 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:06,709 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:06,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 23:40:06,710 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:06,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1684555216, now seen corresponding path program 1 times [2021-10-28 23:40:06,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:06,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190287263] [2021-10-28 23:40:06,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:06,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:06,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:06,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:06,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190287263] [2021-10-28 23:40:06,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190287263] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:06,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:06,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:40:06,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517268865] [2021-10-28 23:40:06,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:40:06,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:40:06,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:40:06,836 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-28 23:40:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:07,437 INFO L93 Difference]: Finished difference Result 324 states and 356 transitions. [2021-10-28 23:40:07,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:40:07,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2021-10-28 23:40:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:07,441 INFO L225 Difference]: With dead ends: 324 [2021-10-28 23:40:07,441 INFO L226 Difference]: Without dead ends: 324 [2021-10-28 23:40:07,442 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:40:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-28 23:40:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 268. [2021-10-28 23:40:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 255 states have internal predecessors, (265), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-28 23:40:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2021-10-28 23:40:07,454 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 15 [2021-10-28 23:40:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:07,455 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2021-10-28 23:40:07,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-28 23:40:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2021-10-28 23:40:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 23:40:07,456 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:07,457 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:07,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 23:40:07,457 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr20ENSURES_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash 663488011, now seen corresponding path program 1 times [2021-10-28 23:40:07,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:07,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441738709] [2021-10-28 23:40:07,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:07,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:07,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:07,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:07,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441738709] [2021-10-28 23:40:07,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441738709] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:07,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:07,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:40:07,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755382942] [2021-10-28 23:40:07,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:40:07,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:07,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:40:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:40:07,541 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-10-28 23:40:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:08,243 INFO L93 Difference]: Finished difference Result 327 states and 359 transitions. [2021-10-28 23:40:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:40:08,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 21 [2021-10-28 23:40:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:08,247 INFO L225 Difference]: With dead ends: 327 [2021-10-28 23:40:08,247 INFO L226 Difference]: Without dead ends: 327 [2021-10-28 23:40:08,248 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:40:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-10-28 23:40:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2021-10-28 23:40:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 144 states have (on average 1.8333333333333333) internal successors, (264), 255 states have internal predecessors, (264), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-28 23:40:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2021-10-28 23:40:08,260 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 21 [2021-10-28 23:40:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:08,261 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2021-10-28 23:40:08,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-10-28 23:40:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2021-10-28 23:40:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-28 23:40:08,262 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:08,262 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:08,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 23:40:08,263 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash -584553579, now seen corresponding path program 1 times [2021-10-28 23:40:08,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:08,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895602973] [2021-10-28 23:40:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:08,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:08,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:08,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:08,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895602973] [2021-10-28 23:40:08,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895602973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:08,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:08,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:40:08,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521186931] [2021-10-28 23:40:08,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:40:08,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:08,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:40:08,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:40:08,359 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:09,285 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2021-10-28 23:40:09,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:40:09,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-10-28 23:40:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:09,289 INFO L225 Difference]: With dead ends: 382 [2021-10-28 23:40:09,290 INFO L226 Difference]: Without dead ends: 382 [2021-10-28 23:40:09,290 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-28 23:40:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-10-28 23:40:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 271. [2021-10-28 23:40:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 148 states have (on average 1.8243243243243243) internal successors, (270), 258 states have internal predecessors, (270), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-28 23:40:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2021-10-28 23:40:09,304 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 25 [2021-10-28 23:40:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:09,304 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2021-10-28 23:40:09,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2021-10-28 23:40:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-28 23:40:09,306 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:09,306 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:09,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 23:40:09,307 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting inspect_beforeErr0REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash -584567887, now seen corresponding path program 1 times [2021-10-28 23:40:09,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:09,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960387708] [2021-10-28 23:40:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:09,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:09,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:09,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960387708] [2021-10-28 23:40:09,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960387708] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:09,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:09,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:40:09,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124256101] [2021-10-28 23:40:09,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:40:09,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:40:09,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:40:09,445 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:10,392 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2021-10-28 23:40:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:40:10,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-10-28 23:40:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:10,397 INFO L225 Difference]: With dead ends: 310 [2021-10-28 23:40:10,398 INFO L226 Difference]: Without dead ends: 310 [2021-10-28 23:40:10,401 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-28 23:40:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-28 23:40:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2021-10-28 23:40:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 149 states have (on average 1.7583892617449663) internal successors, (262), 249 states have internal predecessors, (262), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-10-28 23:40:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2021-10-28 23:40:10,423 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 25 [2021-10-28 23:40:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:10,424 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2021-10-28 23:40:10,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2021-10-28 23:40:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-28 23:40:10,425 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:10,425 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:10,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 23:40:10,425 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting inspect_beforeErr1REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -584567886, now seen corresponding path program 1 times [2021-10-28 23:40:10,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:10,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646180196] [2021-10-28 23:40:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:10,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:10,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:10,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646180196] [2021-10-28 23:40:10,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646180196] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:10,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:10,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:40:10,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145958902] [2021-10-28 23:40:10,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:40:10,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:40:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:40:10,546 INFO L87 Difference]: Start difference. First operand 263 states and 289 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:11,718 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-10-28 23:40:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:40:11,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-10-28 23:40:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:11,722 INFO L225 Difference]: With dead ends: 381 [2021-10-28 23:40:11,722 INFO L226 Difference]: Without dead ends: 381 [2021-10-28 23:40:11,723 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-28 23:40:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-28 23:40:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 288. [2021-10-28 23:40:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 173 states have (on average 1.6878612716763006) internal successors, (292), 273 states have internal predecessors, (292), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-28 23:40:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2021-10-28 23:40:11,736 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 25 [2021-10-28 23:40:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:11,737 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2021-10-28 23:40:11,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2021-10-28 23:40:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 23:40:11,739 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:11,739 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:11,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 23:40:11,740 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1204412220, now seen corresponding path program 1 times [2021-10-28 23:40:11,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:11,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063733944] [2021-10-28 23:40:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:11,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:11,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 23:40:11,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:11,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063733944] [2021-10-28 23:40:11,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063733944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:11,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:11,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:40:11,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037708703] [2021-10-28 23:40:11,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:40:11,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:11,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:40:11,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:40:11,844 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:12,598 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2021-10-28 23:40:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:40:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-10-28 23:40:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:12,601 INFO L225 Difference]: With dead ends: 307 [2021-10-28 23:40:12,601 INFO L226 Difference]: Without dead ends: 307 [2021-10-28 23:40:12,602 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:40:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-10-28 23:40:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2021-10-28 23:40:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 173 states have (on average 1.676300578034682) internal successors, (290), 272 states have internal predecessors, (290), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-28 23:40:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2021-10-28 23:40:12,613 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 32 [2021-10-28 23:40:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:12,614 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2021-10-28 23:40:12,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2021-10-28 23:40:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 23:40:12,615 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:12,616 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:12,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 23:40:12,616 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:12,617 INFO L85 PathProgramCache]: Analyzing trace with hash 523995142, now seen corresponding path program 1 times [2021-10-28 23:40:12,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:12,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717959615] [2021-10-28 23:40:12,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:12,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:12,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 23:40:12,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:12,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717959615] [2021-10-28 23:40:12,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717959615] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:12,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:12,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:40:12,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105710109] [2021-10-28 23:40:12,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:40:12,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:12,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:40:12,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:40:12,734 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:13,554 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2021-10-28 23:40:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:40:13,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-10-28 23:40:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:13,557 INFO L225 Difference]: With dead ends: 306 [2021-10-28 23:40:13,557 INFO L226 Difference]: Without dead ends: 306 [2021-10-28 23:40:13,558 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:40:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-28 23:40:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2021-10-28 23:40:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.6647398843930636) internal successors, (288), 271 states have internal predecessors, (288), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-28 23:40:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2021-10-28 23:40:13,574 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 32 [2021-10-28 23:40:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:13,577 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2021-10-28 23:40:13,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2021-10-28 23:40:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 23:40:13,582 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:13,582 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:13,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 23:40:13,583 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash 173443807, now seen corresponding path program 1 times [2021-10-28 23:40:13,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:13,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954376077] [2021-10-28 23:40:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:13,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:13,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:13,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954376077] [2021-10-28 23:40:13,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954376077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:13,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:13,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 23:40:13,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551054940] [2021-10-28 23:40:13,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:40:13,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:13,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:40:13,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:40:13,763 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:14,752 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2021-10-28 23:40:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:40:14,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-10-28 23:40:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:14,756 INFO L225 Difference]: With dead ends: 341 [2021-10-28 23:40:14,756 INFO L226 Difference]: Without dead ends: 341 [2021-10-28 23:40:14,756 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:40:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-10-28 23:40:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2021-10-28 23:40:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.6589595375722543) internal successors, (287), 271 states have internal predecessors, (287), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-28 23:40:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 314 transitions. [2021-10-28 23:40:14,766 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 314 transitions. Word has length 35 [2021-10-28 23:40:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:14,767 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 314 transitions. [2021-10-28 23:40:14,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 314 transitions. [2021-10-28 23:40:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 23:40:14,768 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:14,768 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:14,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 23:40:14,769 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:14,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:14,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2042093490, now seen corresponding path program 1 times [2021-10-28 23:40:14,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:14,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252072591] [2021-10-28 23:40:14,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:14,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:14,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:14,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:14,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252072591] [2021-10-28 23:40:14,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252072591] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:14,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:14,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 23:40:14,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661013453] [2021-10-28 23:40:14,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:40:14,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:40:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:40:14,860 INFO L87 Difference]: Start difference. First operand 286 states and 314 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:15,733 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2021-10-28 23:40:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:40:15,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-10-28 23:40:15,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:15,736 INFO L225 Difference]: With dead ends: 340 [2021-10-28 23:40:15,736 INFO L226 Difference]: Without dead ends: 340 [2021-10-28 23:40:15,736 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:40:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-28 23:40:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2021-10-28 23:40:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.653179190751445) internal successors, (286), 271 states have internal predecessors, (286), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-28 23:40:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2021-10-28 23:40:15,746 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 35 [2021-10-28 23:40:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:15,746 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2021-10-28 23:40:15,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2021-10-28 23:40:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 23:40:15,748 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:15,748 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:15,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 23:40:15,748 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting inspect_beforeErr18REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1081480683, now seen corresponding path program 1 times [2021-10-28 23:40:15,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:15,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355257553] [2021-10-28 23:40:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:15,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:15,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:15,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355257553] [2021-10-28 23:40:15,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355257553] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:15,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:15,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 23:40:15,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709865181] [2021-10-28 23:40:15,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 23:40:15,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 23:40:15,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:40:15,922 INFO L87 Difference]: Start difference. First operand 286 states and 313 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:17,026 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2021-10-28 23:40:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 23:40:17,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-10-28 23:40:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:17,029 INFO L225 Difference]: With dead ends: 354 [2021-10-28 23:40:17,029 INFO L226 Difference]: Without dead ends: 354 [2021-10-28 23:40:17,030 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-10-28 23:40:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-10-28 23:40:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 287. [2021-10-28 23:40:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6551724137931034) internal successors, (288), 272 states have internal predecessors, (288), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-28 23:40:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 315 transitions. [2021-10-28 23:40:17,040 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 315 transitions. Word has length 36 [2021-10-28 23:40:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:17,040 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 315 transitions. [2021-10-28 23:40:17,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 315 transitions. [2021-10-28 23:40:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 23:40:17,041 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:17,041 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:17,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 23:40:17,042 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting inspect_beforeErr19REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1081480684, now seen corresponding path program 1 times [2021-10-28 23:40:17,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:17,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98266740] [2021-10-28 23:40:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:17,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:17,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:17,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98266740] [2021-10-28 23:40:17,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98266740] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:17,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:17,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:40:17,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364013456] [2021-10-28 23:40:17,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:40:17,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:17,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:40:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:40:17,209 INFO L87 Difference]: Start difference. First operand 287 states and 315 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:18,337 INFO L93 Difference]: Finished difference Result 367 states and 402 transitions. [2021-10-28 23:40:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:40:18,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-10-28 23:40:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:18,345 INFO L225 Difference]: With dead ends: 367 [2021-10-28 23:40:18,345 INFO L226 Difference]: Without dead ends: 367 [2021-10-28 23:40:18,345 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:40:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-10-28 23:40:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 287. [2021-10-28 23:40:18,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6494252873563218) internal successors, (287), 272 states have internal predecessors, (287), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-28 23:40:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2021-10-28 23:40:18,359 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 36 [2021-10-28 23:40:18,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:18,360 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2021-10-28 23:40:18,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2021-10-28 23:40:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 23:40:18,361 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:18,361 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:18,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 23:40:18,362 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting inspect_beforeErr8REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:18,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:18,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1119996019, now seen corresponding path program 1 times [2021-10-28 23:40:18,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:18,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789352706] [2021-10-28 23:40:18,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:18,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:18,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:18,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789352706] [2021-10-28 23:40:18,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789352706] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:18,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:18,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 23:40:18,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20858586] [2021-10-28 23:40:18,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 23:40:18,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:18,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 23:40:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:40:18,560 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:19,817 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2021-10-28 23:40:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 23:40:19,818 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-10-28 23:40:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:19,820 INFO L225 Difference]: With dead ends: 352 [2021-10-28 23:40:19,820 INFO L226 Difference]: Without dead ends: 352 [2021-10-28 23:40:19,821 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-10-28 23:40:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-10-28 23:40:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2021-10-28 23:40:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 272 states have internal predecessors, (286), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-28 23:40:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2021-10-28 23:40:19,834 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 36 [2021-10-28 23:40:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:19,834 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2021-10-28 23:40:19,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2021-10-28 23:40:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 23:40:19,835 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:19,836 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:19,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 23:40:19,836 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting inspect_beforeErr9REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1119996018, now seen corresponding path program 1 times [2021-10-28 23:40:19,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:19,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109582103] [2021-10-28 23:40:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:19,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 23:40:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:40:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:40:20,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:40:20,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109582103] [2021-10-28 23:40:20,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109582103] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:40:20,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:40:20,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:40:20,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127085251] [2021-10-28 23:40:20,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:40:20,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:40:20,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:40:20,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:40:20,034 INFO L87 Difference]: Start difference. First operand 287 states and 313 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:40:21,039 INFO L93 Difference]: Finished difference Result 365 states and 400 transitions. [2021-10-28 23:40:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:40:21,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-10-28 23:40:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:40:21,049 INFO L225 Difference]: With dead ends: 365 [2021-10-28 23:40:21,049 INFO L226 Difference]: Without dead ends: 365 [2021-10-28 23:40:21,051 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:40:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-10-28 23:40:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2021-10-28 23:40:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6379310344827587) internal successors, (285), 272 states have internal predecessors, (285), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-28 23:40:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 312 transitions. [2021-10-28 23:40:21,065 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 312 transitions. Word has length 36 [2021-10-28 23:40:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:40:21,065 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 312 transitions. [2021-10-28 23:40:21,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-28 23:40:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 312 transitions. [2021-10-28 23:40:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:40:21,066 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:40:21,066 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:21,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 23:40:21,067 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-10-28 23:40:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:40:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1841504364, now seen corresponding path program 1 times [2021-10-28 23:40:21,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:40:21,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780678194] [2021-10-28 23:40:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:40:21,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:40:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:40:21,100 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:40:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:40:21,179 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:40:21,179 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 23:40:21,181 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 23:40:21,183 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr0REQUIRES_VIOLATION [2021-10-28 23:40:21,183 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr1REQUIRES_VIOLATION [2021-10-28 23:40:21,183 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr2REQUIRES_VIOLATION [2021-10-28 23:40:21,183 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr3REQUIRES_VIOLATION [2021-10-28 23:40:21,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr4REQUIRES_VIOLATION [2021-10-28 23:40:21,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr5REQUIRES_VIOLATION [2021-10-28 23:40:21,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr6REQUIRES_VIOLATION [2021-10-28 23:40:21,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr7REQUIRES_VIOLATION [2021-10-28 23:40:21,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr8REQUIRES_VIOLATION [2021-10-28 23:40:21,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr9REQUIRES_VIOLATION [2021-10-28 23:40:21,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr10REQUIRES_VIOLATION [2021-10-28 23:40:21,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr11REQUIRES_VIOLATION [2021-10-28 23:40:21,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr12REQUIRES_VIOLATION [2021-10-28 23:40:21,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr13REQUIRES_VIOLATION [2021-10-28 23:40:21,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr14REQUIRES_VIOLATION [2021-10-28 23:40:21,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr15REQUIRES_VIOLATION [2021-10-28 23:40:21,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr16REQUIRES_VIOLATION [2021-10-28 23:40:21,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr17REQUIRES_VIOLATION [2021-10-28 23:40:21,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr18REQUIRES_VIOLATION [2021-10-28 23:40:21,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr19REQUIRES_VIOLATION [2021-10-28 23:40:21,186 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr0REQUIRES_VIOLATION [2021-10-28 23:40:21,187 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr1REQUIRES_VIOLATION [2021-10-28 23:40:21,187 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr2REQUIRES_VIOLATION [2021-10-28 23:40:21,187 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr3REQUIRES_VIOLATION [2021-10-28 23:40:21,187 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr4REQUIRES_VIOLATION [2021-10-28 23:40:21,187 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr5REQUIRES_VIOLATION [2021-10-28 23:40:21,187 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr6REQUIRES_VIOLATION [2021-10-28 23:40:21,188 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr7REQUIRES_VIOLATION [2021-10-28 23:40:21,189 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr8REQUIRES_VIOLATION [2021-10-28 23:40:21,189 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr9REQUIRES_VIOLATION [2021-10-28 23:40:21,189 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr10REQUIRES_VIOLATION [2021-10-28 23:40:21,189 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr11REQUIRES_VIOLATION [2021-10-28 23:40:21,189 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATION [2021-10-28 23:40:21,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATION [2021-10-28 23:40:21,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATION [2021-10-28 23:40:21,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATION [2021-10-28 23:40:21,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATION [2021-10-28 23:40:21,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATION [2021-10-28 23:40:21,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATION [2021-10-28 23:40:21,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATION [2021-10-28 23:40:21,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATION [2021-10-28 23:40:21,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATION [2021-10-28 23:40:21,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATION [2021-10-28 23:40:21,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATION [2021-10-28 23:40:21,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATION [2021-10-28 23:40:21,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATION [2021-10-28 23:40:21,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr0REQUIRES_VIOLATION [2021-10-28 23:40:21,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr1REQUIRES_VIOLATION [2021-10-28 23:40:21,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr2REQUIRES_VIOLATION [2021-10-28 23:40:21,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr3REQUIRES_VIOLATION [2021-10-28 23:40:21,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr4REQUIRES_VIOLATION [2021-10-28 23:40:21,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr5REQUIRES_VIOLATION [2021-10-28 23:40:21,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr6REQUIRES_VIOLATION [2021-10-28 23:40:21,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr7REQUIRES_VIOLATION [2021-10-28 23:40:21,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr8REQUIRES_VIOLATION [2021-10-28 23:40:21,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr9REQUIRES_VIOLATION [2021-10-28 23:40:21,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr10REQUIRES_VIOLATION [2021-10-28 23:40:21,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr11REQUIRES_VIOLATION [2021-10-28 23:40:21,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr12REQUIRES_VIOLATION [2021-10-28 23:40:21,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr13REQUIRES_VIOLATION [2021-10-28 23:40:21,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr14REQUIRES_VIOLATION [2021-10-28 23:40:21,194 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr15REQUIRES_VIOLATION [2021-10-28 23:40:21,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr16REQUIRES_VIOLATION [2021-10-28 23:40:21,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr17REQUIRES_VIOLATION [2021-10-28 23:40:21,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr18REQUIRES_VIOLATION [2021-10-28 23:40:21,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr19REQUIRES_VIOLATION [2021-10-28 23:40:21,195 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr20REQUIRES_VIOLATION [2021-10-28 23:40:21,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr21REQUIRES_VIOLATION [2021-10-28 23:40:21,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-28 23:40:21,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-28 23:40:21,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-10-28 23:40:21,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-28 23:40:21,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-10-28 23:40:21,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-28 23:40:21,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-28 23:40:21,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-28 23:40:21,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-28 23:40:21,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-28 23:40:21,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-28 23:40:21,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-28 23:40:21,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:40:21,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:40:21,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:40:21,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-28 23:40:21,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-28 23:40:21,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:40:21,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:40:21,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:40:21,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20ENSURES_VIOLATIONMEMORY_LEAK [2021-10-28 23:40:21,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr0REQUIRES_VIOLATION [2021-10-28 23:40:21,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr1REQUIRES_VIOLATION [2021-10-28 23:40:21,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr2REQUIRES_VIOLATION [2021-10-28 23:40:21,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr3REQUIRES_VIOLATION [2021-10-28 23:40:21,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr4REQUIRES_VIOLATION [2021-10-28 23:40:21,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr5REQUIRES_VIOLATION [2021-10-28 23:40:21,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr6REQUIRES_VIOLATION [2021-10-28 23:40:21,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr7REQUIRES_VIOLATION [2021-10-28 23:40:21,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr8REQUIRES_VIOLATION [2021-10-28 23:40:21,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr9REQUIRES_VIOLATION [2021-10-28 23:40:21,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr10REQUIRES_VIOLATION [2021-10-28 23:40:21,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr11REQUIRES_VIOLATION [2021-10-28 23:40:21,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:40:21,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:40:21,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE [2021-10-28 23:40:21,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 23:40:21,206 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:40:21,211 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:40:21,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:40:21 BoogieIcfgContainer [2021-10-28 23:40:21,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:40:21,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:40:21,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:40:21,263 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:40:21,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:40:02" (3/4) ... [2021-10-28 23:40:21,265 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 23:40:21,328 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:40:21,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:40:21,331 INFO L168 Benchmark]: Toolchain (without parser) took 21059.63 ms. Allocated memory was 113.2 MB in the beginning and 136.3 MB in the end (delta: 23.1 MB). Free memory was 77.4 MB in the beginning and 43.2 MB in the end (delta: 34.3 MB). Peak memory consumption was 55.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:40:21,331 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 113.2 MB. Free memory was 89.6 MB in the beginning and 89.6 MB in the end (delta: 25.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:40:21,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.09 ms. Allocated memory is still 113.2 MB. Free memory was 77.1 MB in the beginning and 81.6 MB in the end (delta: -4.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:40:21,332 INFO L168 Benchmark]: Boogie Preprocessor took 141.74 ms. Allocated memory is still 113.2 MB. Free memory was 81.6 MB in the beginning and 77.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 23:40:21,332 INFO L168 Benchmark]: RCFGBuilder took 1282.07 ms. Allocated memory is still 113.2 MB. Free memory was 77.4 MB in the beginning and 86.6 MB in the end (delta: -9.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 16.1 GB. [2021-10-28 23:40:21,332 INFO L168 Benchmark]: TraceAbstraction took 18930.49 ms. Allocated memory was 113.2 MB in the beginning and 136.3 MB in the end (delta: 23.1 MB). Free memory was 86.0 MB in the beginning and 45.3 MB in the end (delta: 40.8 MB). Peak memory consumption was 63.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:40:21,333 INFO L168 Benchmark]: Witness Printer took 66.17 ms. Allocated memory is still 136.3 MB. Free memory was 45.3 MB in the beginning and 43.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:40:21,335 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 113.2 MB. Free memory was 89.6 MB in the beginning and 89.6 MB in the end (delta: 25.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 633.09 ms. Allocated memory is still 113.2 MB. Free memory was 77.1 MB in the beginning and 81.6 MB in the end (delta: -4.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 141.74 ms. Allocated memory is still 113.2 MB. Free memory was 81.6 MB in the beginning and 77.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1282.07 ms. Allocated memory is still 113.2 MB. Free memory was 77.4 MB in the beginning and 86.6 MB in the end (delta: -9.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18930.49 ms. Allocated memory was 113.2 MB in the beginning and 136.3 MB in the end (delta: 23.1 MB). Free memory was 86.0 MB in the beginning and 45.3 MB in the end (delta: 40.8 MB). Peak memory consumption was 63.0 MB. Max. memory is 16.1 GB. * Witness Printer took 66.17 ms. Allocated memory is still 136.3 MB. Free memory was 45.3 MB in the beginning and 43.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node VAL [data={0:0}, node={-1:0}] [L644] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, data={0:0}, node={-1:0}] [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-3:0}, node={-1:0}] [L648] item->slist = node VAL [data={0:0}, item={-3:0}, node={-1:0}] [L649] item->next = data VAL [data={0:0}, item={-3:0}, node={-1:0}] [L650] data = item VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L654] CALL inspect_before(data) VAL [shape={-3:0}] [L615] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L616] shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L623] EXPR shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L625] EXPR shape->slist->next VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 288 locations, 105 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3487 SDtfs, 5208 SDslu, 5333 SDs, 0 SdLazy, 16207 SolverSat, 644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 2992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-28 23:40:21,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2105bb47-1f19-49b1-9ef7-4d10661f991c/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...