./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8 --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 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:23:44,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:23:44,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:23:44,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:23:44,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:23:44,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:23:44,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:23:44,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:23:44,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:23:44,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:23:44,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:23:44,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:23:44,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:23:44,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:23:44,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:23:44,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:23:44,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:23:44,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:23:44,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:23:44,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:23:44,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:23:44,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:23:44,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:23:44,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:23:44,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:23:44,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:23:44,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:23:44,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:23:44,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:23:44,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:23:44,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:23:44,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:23:44,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:23:44,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:23:44,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:23:44,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:23:44,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:23:44,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:23:44,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:23:44,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:23:44,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:23:44,566 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-16 11:23:44,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:23:44,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:23:44,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:23:44,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:23:44,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:23:44,621 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:23:44,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:23:44,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:23:44,622 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:23:44,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:23:44,622 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:23:44,623 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:23:44,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:23:44,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:23:44,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:23:44,623 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:23:44,624 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:23:44,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:23:44,624 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:23:44,626 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:23:44,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:23:44,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:23:44,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:23:44,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:23:44,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:23:44,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:23:44,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:23:44,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:23:44,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:23:44,630 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_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/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_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8 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 [2022-11-16 11:23:44,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:23:44,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:23:44,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:23:44,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:23:44,969 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:23:44,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-11-16 11:23:45,047 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/data/b23b81007/e08775507b1b45eaa220308fc320f7cb/FLAGb47ed10d7 [2022-11-16 11:23:45,614 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:23:45,615 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-11-16 11:23:45,630 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/data/b23b81007/e08775507b1b45eaa220308fc320f7cb/FLAGb47ed10d7 [2022-11-16 11:23:45,893 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/data/b23b81007/e08775507b1b45eaa220308fc320f7cb [2022-11-16 11:23:45,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:23:45,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:23:45,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:23:45,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:23:45,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:23:45,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:23:45" (1/1) ... [2022-11-16 11:23:45,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23cefae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:45, skipping insertion in model container [2022-11-16 11:23:45,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:23:45" (1/1) ... [2022-11-16 11:23:45,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:23:45,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:23:46,427 WARN L229 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_1039febe-2293-4831-92c7-99fc51ac7f72/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-11-16 11:23:46,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:23:46,512 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:23:46,578 WARN L229 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_1039febe-2293-4831-92c7-99fc51ac7f72/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-11-16 11:23:46,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:23:46,643 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:23:46,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46 WrapperNode [2022-11-16 11:23:46,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:23:46,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:23:46,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:23:46,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:23:46,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,748 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 294 [2022-11-16 11:23:46,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:23:46,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:23:46,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:23:46,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:23:46,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,812 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:23:46,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:23:46,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:23:46,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:23:46,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (1/1) ... [2022-11-16 11:23:46,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:23:46,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:23:46,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:23:46,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:23:46,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:23:46,924 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-11-16 11:23:46,924 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-11-16 11:23:46,924 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-11-16 11:23:46,925 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-11-16 11:23:46,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:23:46,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:23:46,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:23:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:23:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:23:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:23:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:23:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:23:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:23:46,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:23:47,064 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:23:47,067 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:23:47,836 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:23:47,848 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:23:47,850 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2022-11-16 11:23:47,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:23:47 BoogieIcfgContainer [2022-11-16 11:23:47,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:23:47,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:23:47,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:23:47,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:23:47,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:23:45" (1/3) ... [2022-11-16 11:23:47,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbe8b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:23:47, skipping insertion in model container [2022-11-16 11:23:47,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:23:46" (2/3) ... [2022-11-16 11:23:47,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbe8b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:23:47, skipping insertion in model container [2022-11-16 11:23:47,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:23:47" (3/3) ... [2022-11-16 11:23:47,887 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2022-11-16 11:23:47,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:23:47,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2022-11-16 11:23:47,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:23:47,978 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e977512, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:23:47,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2022-11-16 11:23:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-16 11:23:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:23:47,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:47,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:23:47,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:47,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:47,996 INFO L85 PathProgramCache]: Analyzing trace with hash 56404890, now seen corresponding path program 1 times [2022-11-16 11:23:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:48,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681137384] [2022-11-16 11:23:48,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:48,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:48,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:48,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681137384] [2022-11-16 11:23:48,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681137384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:48,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:48,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:23:48,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363320137] [2022-11-16 11:23:48,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:48,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:23:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:48,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:23:48,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:23:48,220 INFO L87 Difference]: Start difference. First operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:48,285 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2022-11-16 11:23:48,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:23:48,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:23:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:48,312 INFO L225 Difference]: With dead ends: 260 [2022-11-16 11:23:48,312 INFO L226 Difference]: Without dead ends: 258 [2022-11-16 11:23:48,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:23:48,319 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:48,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:23:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-16 11:23:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-11-16 11:23:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 283 transitions. [2022-11-16 11:23:48,411 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 283 transitions. Word has length 5 [2022-11-16 11:23:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:48,412 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 283 transitions. [2022-11-16 11:23:48,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2022-11-16 11:23:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:23:48,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:48,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:23:48,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:23:48,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491005, now seen corresponding path program 1 times [2022-11-16 11:23:48,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:48,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94069507] [2022-11-16 11:23:48,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:48,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:48,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:48,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94069507] [2022-11-16 11:23:48,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94069507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:48,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:48,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:23:48,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45154514] [2022-11-16 11:23:48,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:48,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:23:48,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:23:48,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:48,497 INFO L87 Difference]: Start difference. First operand 258 states and 283 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:48,832 INFO L93 Difference]: Finished difference Result 391 states and 435 transitions. [2022-11-16 11:23:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:23:48,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 11:23:48,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:48,835 INFO L225 Difference]: With dead ends: 391 [2022-11-16 11:23:48,835 INFO L226 Difference]: Without dead ends: 390 [2022-11-16 11:23:48,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:48,837 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 133 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:48,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 396 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:23:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-16 11:23:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 261. [2022-11-16 11:23:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 287 transitions. [2022-11-16 11:23:48,849 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 287 transitions. Word has length 6 [2022-11-16 11:23:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:48,850 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 287 transitions. [2022-11-16 11:23:48,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 287 transitions. [2022-11-16 11:23:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:23:48,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:48,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:23:48,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:23:48,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491563, now seen corresponding path program 1 times [2022-11-16 11:23:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725124907] [2022-11-16 11:23:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:48,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:48,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725124907] [2022-11-16 11:23:48,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725124907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:48,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:48,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:23:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341625297] [2022-11-16 11:23:48,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:48,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:23:48,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:48,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:23:48,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:48,927 INFO L87 Difference]: Start difference. First operand 261 states and 287 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:49,249 INFO L93 Difference]: Finished difference Result 439 states and 489 transitions. [2022-11-16 11:23:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:23:49,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 11:23:49,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:49,253 INFO L225 Difference]: With dead ends: 439 [2022-11-16 11:23:49,253 INFO L226 Difference]: Without dead ends: 439 [2022-11-16 11:23:49,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:49,260 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 199 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:49,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 569 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:23:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-16 11:23:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 259. [2022-11-16 11:23:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 285 transitions. [2022-11-16 11:23:49,286 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 285 transitions. Word has length 6 [2022-11-16 11:23:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:49,286 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 285 transitions. [2022-11-16 11:23:49,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 285 transitions. [2022-11-16 11:23:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:23:49,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:49,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:23:49,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:23:49,289 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491564, now seen corresponding path program 1 times [2022-11-16 11:23:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:49,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402240391] [2022-11-16 11:23:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:49,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:49,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402240391] [2022-11-16 11:23:49,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402240391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:49,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:49,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:23:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815333572] [2022-11-16 11:23:49,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:49,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:23:49,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:49,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:23:49,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:49,446 INFO L87 Difference]: Start difference. First operand 259 states and 285 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:49,738 INFO L93 Difference]: Finished difference Result 400 states and 444 transitions. [2022-11-16 11:23:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:23:49,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 11:23:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:49,741 INFO L225 Difference]: With dead ends: 400 [2022-11-16 11:23:49,741 INFO L226 Difference]: Without dead ends: 400 [2022-11-16 11:23:49,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:49,742 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 162 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:49,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 560 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:23:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-16 11:23:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 257. [2022-11-16 11:23:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2022-11-16 11:23:49,750 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 6 [2022-11-16 11:23:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:49,750 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2022-11-16 11:23:49,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2022-11-16 11:23:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:23:49,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:49,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:23:49,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:23:49,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:49,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 6274696, now seen corresponding path program 1 times [2022-11-16 11:23:49,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:49,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739092311] [2022-11-16 11:23:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:49,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:49,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739092311] [2022-11-16 11:23:49,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739092311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:49,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:49,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:23:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25646750] [2022-11-16 11:23:49,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:49,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:23:49,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:23:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:49,785 INFO L87 Difference]: Start difference. First operand 257 states and 283 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:49,817 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2022-11-16 11:23:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:23:49,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 11:23:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:49,819 INFO L225 Difference]: With dead ends: 272 [2022-11-16 11:23:49,819 INFO L226 Difference]: Without dead ends: 271 [2022-11-16 11:23:49,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:49,820 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 14 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:49,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 537 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:23:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-16 11:23:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 256. [2022-11-16 11:23:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2022-11-16 11:23:49,827 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 8 [2022-11-16 11:23:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:49,828 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2022-11-16 11:23:49,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2022-11-16 11:23:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:23:49,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:49,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:23:49,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:23:49,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash -849555632, now seen corresponding path program 1 times [2022-11-16 11:23:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:49,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497705868] [2022-11-16 11:23:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:49,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497705868] [2022-11-16 11:23:49,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497705868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:49,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:49,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:23:49,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46917435] [2022-11-16 11:23:49,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:49,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:23:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:49,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:23:49,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:49,996 INFO L87 Difference]: Start difference. First operand 256 states and 281 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:50,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:50,220 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2022-11-16 11:23:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:23:50,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:23:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:50,223 INFO L225 Difference]: With dead ends: 342 [2022-11-16 11:23:50,223 INFO L226 Difference]: Without dead ends: 342 [2022-11-16 11:23:50,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:50,224 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:50,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 346 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:23:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-16 11:23:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 254. [2022-11-16 11:23:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2022-11-16 11:23:50,233 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 11 [2022-11-16 11:23:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:50,233 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2022-11-16 11:23:50,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2022-11-16 11:23:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:23:50,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:50,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:23:50,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:23:50,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash -849555633, now seen corresponding path program 1 times [2022-11-16 11:23:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:50,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707990094] [2022-11-16 11:23:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:50,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:50,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707990094] [2022-11-16 11:23:50,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707990094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:50,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:50,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:23:50,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437222954] [2022-11-16 11:23:50,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:50,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:23:50,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:50,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:23:50,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:50,313 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:50,567 INFO L93 Difference]: Finished difference Result 377 states and 416 transitions. [2022-11-16 11:23:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:23:50,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:23:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:50,571 INFO L225 Difference]: With dead ends: 377 [2022-11-16 11:23:50,571 INFO L226 Difference]: Without dead ends: 377 [2022-11-16 11:23:50,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:23:50,573 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 193 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:50,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 312 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:23:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-16 11:23:50,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 252. [2022-11-16 11:23:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 277 transitions. [2022-11-16 11:23:50,585 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 277 transitions. Word has length 11 [2022-11-16 11:23:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:50,585 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 277 transitions. [2022-11-16 11:23:50,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 277 transitions. [2022-11-16 11:23:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:23:50,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:50,586 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:23:50,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:23:50,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash 321246795, now seen corresponding path program 1 times [2022-11-16 11:23:50,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:50,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831044421] [2022-11-16 11:23:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:50,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:50,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:50,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831044421] [2022-11-16 11:23:50,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831044421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:50,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:50,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:23:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106817319] [2022-11-16 11:23:50,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:50,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:23:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:23:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:23:50,719 INFO L87 Difference]: Start difference. First operand 252 states and 277 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:50,788 INFO L93 Difference]: Finished difference Result 407 states and 447 transitions. [2022-11-16 11:23:50,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:23:50,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 11:23:50,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:50,790 INFO L225 Difference]: With dead ends: 407 [2022-11-16 11:23:50,791 INFO L226 Difference]: Without dead ends: 407 [2022-11-16 11:23:50,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:23:50,794 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 602 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:50,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 508 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:23:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-16 11:23:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 252. [2022-11-16 11:23:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 276 transitions. [2022-11-16 11:23:50,805 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 276 transitions. Word has length 17 [2022-11-16 11:23:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:50,810 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 276 transitions. [2022-11-16 11:23:50,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 276 transitions. [2022-11-16 11:23:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:23:50,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:50,811 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:23:50,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:23:50,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash -519843690, now seen corresponding path program 1 times [2022-11-16 11:23:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:50,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678174578] [2022-11-16 11:23:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:50,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:50,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678174578] [2022-11-16 11:23:50,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678174578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:50,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:50,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:23:50,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259277997] [2022-11-16 11:23:50,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:50,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:23:50,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:50,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:23:50,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:23:50,931 INFO L87 Difference]: Start difference. First operand 252 states and 276 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:51,115 INFO L93 Difference]: Finished difference Result 714 states and 789 transitions. [2022-11-16 11:23:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:23:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 11:23:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:51,119 INFO L225 Difference]: With dead ends: 714 [2022-11-16 11:23:51,119 INFO L226 Difference]: Without dead ends: 714 [2022-11-16 11:23:51,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:23:51,120 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 1479 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:51,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 705 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:23:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-11-16 11:23:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 280. [2022-11-16 11:23:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 328 transitions. [2022-11-16 11:23:51,131 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 328 transitions. Word has length 19 [2022-11-16 11:23:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:51,131 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 328 transitions. [2022-11-16 11:23:51,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 328 transitions. [2022-11-16 11:23:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:23:51,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:51,132 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:23:51,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:23:51,133 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:51,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash -519854939, now seen corresponding path program 1 times [2022-11-16 11:23:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:51,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122401589] [2022-11-16 11:23:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:51,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:51,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122401589] [2022-11-16 11:23:51,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122401589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:51,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:51,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:23:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995560678] [2022-11-16 11:23:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:51,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:23:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:51,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:23:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:23:51,218 INFO L87 Difference]: Start difference. First operand 280 states and 328 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:51,742 INFO L93 Difference]: Finished difference Result 466 states and 533 transitions. [2022-11-16 11:23:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:23:51,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 11:23:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:51,746 INFO L225 Difference]: With dead ends: 466 [2022-11-16 11:23:51,746 INFO L226 Difference]: Without dead ends: 466 [2022-11-16 11:23:51,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:23:51,747 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 646 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:51,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 547 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:23:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-16 11:23:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 271. [2022-11-16 11:23:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 316 transitions. [2022-11-16 11:23:51,753 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 316 transitions. Word has length 19 [2022-11-16 11:23:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:51,754 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 316 transitions. [2022-11-16 11:23:51,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 316 transitions. [2022-11-16 11:23:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:23:51,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:51,755 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:23:51,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:23:51,755 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash -519854938, now seen corresponding path program 1 times [2022-11-16 11:23:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:51,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186952879] [2022-11-16 11:23:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:51,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:51,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:51,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186952879] [2022-11-16 11:23:51,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186952879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:51,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:51,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:23:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932745290] [2022-11-16 11:23:51,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:51,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:23:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:51,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:23:51,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:23:51,958 INFO L87 Difference]: Start difference. First operand 271 states and 316 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:52,602 INFO L93 Difference]: Finished difference Result 606 states and 668 transitions. [2022-11-16 11:23:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:23:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 11:23:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:52,610 INFO L225 Difference]: With dead ends: 606 [2022-11-16 11:23:52,611 INFO L226 Difference]: Without dead ends: 606 [2022-11-16 11:23:52,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:23:52,612 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 891 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:52,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 571 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:23:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-16 11:23:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 291. [2022-11-16 11:23:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 340 transitions. [2022-11-16 11:23:52,638 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 340 transitions. Word has length 19 [2022-11-16 11:23:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:52,638 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 340 transitions. [2022-11-16 11:23:52,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 340 transitions. [2022-11-16 11:23:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:23:52,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:52,639 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:23:52,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:23:52,640 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:52,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1987558854, now seen corresponding path program 1 times [2022-11-16 11:23:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:52,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604731500] [2022-11-16 11:23:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:23:52,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:52,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604731500] [2022-11-16 11:23:52,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604731500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:52,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:52,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:23:52,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775919494] [2022-11-16 11:23:52,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:52,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:23:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:52,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:23:52,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:23:52,768 INFO L87 Difference]: Start difference. First operand 291 states and 340 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:53,006 INFO L93 Difference]: Finished difference Result 373 states and 428 transitions. [2022-11-16 11:23:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:23:53,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 11:23:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:53,009 INFO L225 Difference]: With dead ends: 373 [2022-11-16 11:23:53,009 INFO L226 Difference]: Without dead ends: 373 [2022-11-16 11:23:53,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:23:53,010 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 104 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:53,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 838 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:23:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-16 11:23:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 290. [2022-11-16 11:23:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 337 transitions. [2022-11-16 11:23:53,020 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 337 transitions. Word has length 26 [2022-11-16 11:23:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:53,021 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 337 transitions. [2022-11-16 11:23:53,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 337 transitions. [2022-11-16 11:23:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:23:53,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:53,022 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:23:53,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:23:53,023 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1626991364, now seen corresponding path program 1 times [2022-11-16 11:23:53,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:53,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477366203] [2022-11-16 11:23:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:53,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:23:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:53,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477366203] [2022-11-16 11:23:53,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477366203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:53,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:53,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:23:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77555200] [2022-11-16 11:23:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:53,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:23:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:53,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:23:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:23:53,132 INFO L87 Difference]: Start difference. First operand 290 states and 337 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:53,329 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2022-11-16 11:23:53,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:23:53,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 11:23:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:53,331 INFO L225 Difference]: With dead ends: 289 [2022-11-16 11:23:53,332 INFO L226 Difference]: Without dead ends: 289 [2022-11-16 11:23:53,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:23:53,332 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 20 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:53,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 863 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:23:53,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-16 11:23:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-11-16 11:23:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 334 transitions. [2022-11-16 11:23:53,341 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 334 transitions. Word has length 26 [2022-11-16 11:23:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:53,341 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 334 transitions. [2022-11-16 11:23:53,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 334 transitions. [2022-11-16 11:23:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:23:53,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:53,343 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:23:53,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:23:53,343 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1169692160, now seen corresponding path program 1 times [2022-11-16 11:23:53,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:53,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377441329] [2022-11-16 11:23:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:53,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:53,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:53,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377441329] [2022-11-16 11:23:53,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377441329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:53,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:53,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:23:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099022665] [2022-11-16 11:23:53,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:53,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:23:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:53,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:23:53,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:23:53,555 INFO L87 Difference]: Start difference. First operand 289 states and 334 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:53,982 INFO L93 Difference]: Finished difference Result 604 states and 661 transitions. [2022-11-16 11:23:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:23:53,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-16 11:23:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:53,986 INFO L225 Difference]: With dead ends: 604 [2022-11-16 11:23:53,986 INFO L226 Difference]: Without dead ends: 604 [2022-11-16 11:23:53,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:23:53,987 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 1290 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:53,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 1040 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:23:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-11-16 11:23:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 289. [2022-11-16 11:23:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 333 transitions. [2022-11-16 11:23:53,998 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 333 transitions. Word has length 29 [2022-11-16 11:23:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:53,999 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 333 transitions. [2022-11-16 11:23:53,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 333 transitions. [2022-11-16 11:23:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:23:54,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:54,000 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:23:54,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:23:54,001 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:54,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash 698957523, now seen corresponding path program 1 times [2022-11-16 11:23:54,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:54,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905945357] [2022-11-16 11:23:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:54,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:54,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:54,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905945357] [2022-11-16 11:23:54,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905945357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:54,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:54,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:23:54,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291638193] [2022-11-16 11:23:54,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:54,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:23:54,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:23:54,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:23:54,298 INFO L87 Difference]: Start difference. First operand 289 states and 333 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:54,703 INFO L93 Difference]: Finished difference Result 603 states and 659 transitions. [2022-11-16 11:23:54,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:23:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-16 11:23:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:54,706 INFO L225 Difference]: With dead ends: 603 [2022-11-16 11:23:54,707 INFO L226 Difference]: Without dead ends: 603 [2022-11-16 11:23:54,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:23:54,708 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 1286 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:54,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1040 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:23:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-11-16 11:23:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 289. [2022-11-16 11:23:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2022-11-16 11:23:54,717 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 29 [2022-11-16 11:23:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:54,718 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2022-11-16 11:23:54,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2022-11-16 11:23:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:23:54,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:54,719 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:23:54,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:23:54,720 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933732, now seen corresponding path program 1 times [2022-11-16 11:23:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:54,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134466739] [2022-11-16 11:23:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:55,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:55,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134466739] [2022-11-16 11:23:55,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134466739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:55,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:55,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:23:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784412988] [2022-11-16 11:23:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:55,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:23:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:55,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:23:55,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:23:55,066 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:55,980 INFO L93 Difference]: Finished difference Result 676 states and 747 transitions. [2022-11-16 11:23:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:23:55,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 11:23:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:55,984 INFO L225 Difference]: With dead ends: 676 [2022-11-16 11:23:55,984 INFO L226 Difference]: Without dead ends: 676 [2022-11-16 11:23:55,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:23:55,985 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1271 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:55,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 916 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:23:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-16 11:23:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 290. [2022-11-16 11:23:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2022-11-16 11:23:55,998 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 30 [2022-11-16 11:23:55,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:55,999 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2022-11-16 11:23:55,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2022-11-16 11:23:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:23:56,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:56,000 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:23:56,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:23:56,001 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:56,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933731, now seen corresponding path program 1 times [2022-11-16 11:23:56,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:56,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481043102] [2022-11-16 11:23:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:56,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481043102] [2022-11-16 11:23:56,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481043102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:56,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:56,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:23:56,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438639286] [2022-11-16 11:23:56,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:56,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:23:56,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:56,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:23:56,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:23:56,414 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:57,668 INFO L93 Difference]: Finished difference Result 801 states and 880 transitions. [2022-11-16 11:23:57,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:23:57,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 11:23:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:57,672 INFO L225 Difference]: With dead ends: 801 [2022-11-16 11:23:57,672 INFO L226 Difference]: Without dead ends: 801 [2022-11-16 11:23:57,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:23:57,673 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1655 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:57,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1655 Valid, 886 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 11:23:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-11-16 11:23:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 290. [2022-11-16 11:23:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 333 transitions. [2022-11-16 11:23:57,683 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 333 transitions. Word has length 30 [2022-11-16 11:23:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:57,683 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 333 transitions. [2022-11-16 11:23:57,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 333 transitions. [2022-11-16 11:23:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:23:57,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:57,685 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:23:57,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:23:57,685 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:57,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:57,686 INFO L85 PathProgramCache]: Analyzing trace with hash 192556862, now seen corresponding path program 1 times [2022-11-16 11:23:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:57,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998340133] [2022-11-16 11:23:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:57,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998340133] [2022-11-16 11:23:57,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998340133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:57,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:57,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:23:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869153008] [2022-11-16 11:23:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:57,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:23:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:23:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:23:57,986 INFO L87 Difference]: Start difference. First operand 290 states and 333 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:23:58,872 INFO L93 Difference]: Finished difference Result 674 states and 745 transitions. [2022-11-16 11:23:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:23:58,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 11:23:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:23:58,876 INFO L225 Difference]: With dead ends: 674 [2022-11-16 11:23:58,876 INFO L226 Difference]: Without dead ends: 674 [2022-11-16 11:23:58,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:23:58,878 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1452 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:23:58,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 985 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:23:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-11-16 11:23:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 290. [2022-11-16 11:23:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:23:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 332 transitions. [2022-11-16 11:23:58,892 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 332 transitions. Word has length 30 [2022-11-16 11:23:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:23:58,892 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 332 transitions. [2022-11-16 11:23:58,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:23:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 332 transitions. [2022-11-16 11:23:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:23:58,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:23:58,893 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:23:58,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:23:58,894 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:23:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:23:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 192556863, now seen corresponding path program 1 times [2022-11-16 11:23:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:23:58,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254322381] [2022-11-16 11:23:58,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:23:58,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:23:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:23:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:23:59,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:23:59,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254322381] [2022-11-16 11:23:59,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254322381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:23:59,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:23:59,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:23:59,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209074462] [2022-11-16 11:23:59,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:23:59,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:23:59,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:23:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:23:59,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:23:59,289 INFO L87 Difference]: Start difference. First operand 290 states and 332 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:24:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:24:00,557 INFO L93 Difference]: Finished difference Result 799 states and 878 transitions. [2022-11-16 11:24:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:24:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-16 11:24:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:24:00,563 INFO L225 Difference]: With dead ends: 799 [2022-11-16 11:24:00,564 INFO L226 Difference]: Without dead ends: 799 [2022-11-16 11:24:00,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:24:00,565 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 1646 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:24:00,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 861 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-16 11:24:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-11-16 11:24:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 290. [2022-11-16 11:24:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 11:24:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 331 transitions. [2022-11-16 11:24:00,580 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 331 transitions. Word has length 30 [2022-11-16 11:24:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:24:00,580 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 331 transitions. [2022-11-16 11:24:00,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:24:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 331 transitions. [2022-11-16 11:24:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 11:24:00,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:24:00,583 INFO L195 NwaCegarLoop]: 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] [2022-11-16 11:24:00,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:24:00,583 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2022-11-16 11:24:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:24:00,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1572782387, now seen corresponding path program 1 times [2022-11-16 11:24:00,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:24:00,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405240390] [2022-11-16 11:24:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:24:00,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:24:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:24:00,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:24:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:24:00,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:24:00,674 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:24:00,675 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2022-11-16 11:24:00,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 105 remaining) [2022-11-16 11:24:00,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 105 remaining) [2022-11-16 11:24:00,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 105 remaining) [2022-11-16 11:24:00,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 105 remaining) [2022-11-16 11:24:00,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 105 remaining) [2022-11-16 11:24:00,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 105 remaining) [2022-11-16 11:24:00,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 105 remaining) [2022-11-16 11:24:00,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 105 remaining) [2022-11-16 11:24:00,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 105 remaining) [2022-11-16 11:24:00,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 105 remaining) [2022-11-16 11:24:00,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 105 remaining) [2022-11-16 11:24:00,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 105 remaining) [2022-11-16 11:24:00,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 105 remaining) [2022-11-16 11:24:00,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 105 remaining) [2022-11-16 11:24:00,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 105 remaining) [2022-11-16 11:24:00,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 105 remaining) [2022-11-16 11:24:00,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 105 remaining) [2022-11-16 11:24:00,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 105 remaining) [2022-11-16 11:24:00,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 105 remaining) [2022-11-16 11:24:00,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 105 remaining) [2022-11-16 11:24:00,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 105 remaining) [2022-11-16 11:24:00,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 105 remaining) [2022-11-16 11:24:00,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 105 remaining) [2022-11-16 11:24:00,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 105 remaining) [2022-11-16 11:24:00,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 105 remaining) [2022-11-16 11:24:00,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 105 remaining) [2022-11-16 11:24:00,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 105 remaining) [2022-11-16 11:24:00,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 105 remaining) [2022-11-16 11:24:00,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 105 remaining) [2022-11-16 11:24:00,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 105 remaining) [2022-11-16 11:24:00,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 105 remaining) [2022-11-16 11:24:00,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 105 remaining) [2022-11-16 11:24:00,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 105 remaining) [2022-11-16 11:24:00,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 105 remaining) [2022-11-16 11:24:00,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 105 remaining) [2022-11-16 11:24:00,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 105 remaining) [2022-11-16 11:24:00,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 105 remaining) [2022-11-16 11:24:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 105 remaining) [2022-11-16 11:24:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 105 remaining) [2022-11-16 11:24:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 105 remaining) [2022-11-16 11:24:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 105 remaining) [2022-11-16 11:24:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 105 remaining) [2022-11-16 11:24:00,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 105 remaining) [2022-11-16 11:24:00,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 105 remaining) [2022-11-16 11:24:00,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 105 remaining) [2022-11-16 11:24:00,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 105 remaining) [2022-11-16 11:24:00,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 105 remaining) [2022-11-16 11:24:00,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 105 remaining) [2022-11-16 11:24:00,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 105 remaining) [2022-11-16 11:24:00,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 105 remaining) [2022-11-16 11:24:00,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 105 remaining) [2022-11-16 11:24:00,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 105 remaining) [2022-11-16 11:24:00,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 105 remaining) [2022-11-16 11:24:00,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 105 remaining) [2022-11-16 11:24:00,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 105 remaining) [2022-11-16 11:24:00,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 105 remaining) [2022-11-16 11:24:00,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 105 remaining) [2022-11-16 11:24:00,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 105 remaining) [2022-11-16 11:24:00,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 105 remaining) [2022-11-16 11:24:00,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 105 remaining) [2022-11-16 11:24:00,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 105 remaining) [2022-11-16 11:24:00,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 105 remaining) [2022-11-16 11:24:00,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 105 remaining) [2022-11-16 11:24:00,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 105 remaining) [2022-11-16 11:24:00,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 105 remaining) [2022-11-16 11:24:00,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 105 remaining) [2022-11-16 11:24:00,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 105 remaining) [2022-11-16 11:24:00,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 105 remaining) [2022-11-16 11:24:00,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 105 remaining) [2022-11-16 11:24:00,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 105 remaining) [2022-11-16 11:24:00,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 105 remaining) [2022-11-16 11:24:00,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 105 remaining) [2022-11-16 11:24:00,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 105 remaining) [2022-11-16 11:24:00,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 105 remaining) [2022-11-16 11:24:00,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 105 remaining) [2022-11-16 11:24:00,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 105 remaining) [2022-11-16 11:24:00,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 105 remaining) [2022-11-16 11:24:00,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 105 remaining) [2022-11-16 11:24:00,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (25 of 105 remaining) [2022-11-16 11:24:00,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (24 of 105 remaining) [2022-11-16 11:24:00,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE (23 of 105 remaining) [2022-11-16 11:24:00,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 105 remaining) [2022-11-16 11:24:00,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 105 remaining) [2022-11-16 11:24:00,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 105 remaining) [2022-11-16 11:24:00,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 105 remaining) [2022-11-16 11:24:00,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 105 remaining) [2022-11-16 11:24:00,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 105 remaining) [2022-11-16 11:24:00,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 105 remaining) [2022-11-16 11:24:00,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 105 remaining) [2022-11-16 11:24:00,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 105 remaining) [2022-11-16 11:24:00,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 105 remaining) [2022-11-16 11:24:00,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 105 remaining) [2022-11-16 11:24:00,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 105 remaining) [2022-11-16 11:24:00,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 105 remaining) [2022-11-16 11:24:00,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 105 remaining) [2022-11-16 11:24:00,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (8 of 105 remaining) [2022-11-16 11:24:00,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (7 of 105 remaining) [2022-11-16 11:24:00,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE (6 of 105 remaining) [2022-11-16 11:24:00,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 105 remaining) [2022-11-16 11:24:00,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 105 remaining) [2022-11-16 11:24:00,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE (3 of 105 remaining) [2022-11-16 11:24:00,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE (2 of 105 remaining) [2022-11-16 11:24:00,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE (1 of 105 remaining) [2022-11-16 11:24:00,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK (0 of 105 remaining) [2022-11-16 11:24:00,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:24:00,705 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:24:00,712 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:24:00,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:24:00 BoogieIcfgContainer [2022-11-16 11:24:00,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:24:00,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:24:00,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:24:00,773 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:24:00,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:23:47" (3/4) ... [2022-11-16 11:24:00,778 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:24:00,831 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:24:00,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:24:00,832 INFO L158 Benchmark]: Toolchain (without parser) took 14934.77ms. Allocated memory was 90.2MB in the beginning and 218.1MB in the end (delta: 127.9MB). Free memory was 52.0MB in the beginning and 92.2MB in the end (delta: -40.2MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2022-11-16 11:24:00,833 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 90.2MB. Free memory was 69.7MB in the beginning and 69.6MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:24:00,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 738.68ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 51.9MB in the beginning and 90.9MB in the end (delta: -39.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 11:24:00,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.05ms. Allocated memory is still 123.7MB. Free memory was 90.9MB in the beginning and 88.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:24:00,834 INFO L158 Benchmark]: Boogie Preprocessor took 67.45ms. Allocated memory is still 123.7MB. Free memory was 88.4MB in the beginning and 85.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:24:00,837 INFO L158 Benchmark]: RCFGBuilder took 1035.90ms. Allocated memory is still 123.7MB. Free memory was 85.8MB in the beginning and 46.8MB in the end (delta: 38.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-16 11:24:00,837 INFO L158 Benchmark]: TraceAbstraction took 12915.23ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 46.5MB in the beginning and 95.4MB in the end (delta: -48.9MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2022-11-16 11:24:00,838 INFO L158 Benchmark]: Witness Printer took 58.78ms. Allocated memory is still 218.1MB. Free memory was 95.4MB in the beginning and 92.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:24:00,840 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.31ms. Allocated memory is still 90.2MB. Free memory was 69.7MB in the beginning and 69.6MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 738.68ms. Allocated memory was 90.2MB in the beginning and 123.7MB in the end (delta: 33.6MB). Free memory was 51.9MB in the beginning and 90.9MB in the end (delta: -39.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.05ms. Allocated memory is still 123.7MB. Free memory was 90.9MB in the beginning and 88.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.45ms. Allocated memory is still 123.7MB. Free memory was 88.4MB in the beginning and 85.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1035.90ms. Allocated memory is still 123.7MB. Free memory was 85.8MB in the beginning and 46.8MB in the end (delta: 38.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12915.23ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 46.5MB in the beginning and 95.4MB in the end (delta: -48.9MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Witness Printer took 58.78ms. Allocated memory is still 218.1MB. Free memory was 95.4MB in the beginning and 92.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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) [L654] CALL inspect_before(data) [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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: 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. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 262 locations, 105 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13221 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13203 mSDsluCounter, 12765 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8280 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6284 IncrementalHoareTripleChecker+Invalid, 6475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 4485 mSDtfsCounter, 6284 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=11, InterpolantAutomatonStates: 122, 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, 19 MinimizatonAttempts, 4281 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 338 ConstructedInterpolants, 0 QuantifiedInterpolants, 2222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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! [2022-11-16 11:24:00,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1039febe-2293-4831-92c7-99fc51ac7f72/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)