./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- 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-dbf71c6-m [2022-10-17 10:35:29,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:35:29,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:35:29,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:35:29,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:35:29,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:35:29,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:35:29,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:35:29,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:35:29,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:35:29,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:35:29,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:35:29,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:35:29,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:35:29,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:35:29,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:35:29,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:35:29,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:35:29,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:35:29,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:35:29,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:35:29,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:35:29,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:35:29,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:35:29,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:35:29,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:35:29,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:35:29,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:35:29,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:35:29,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:35:29,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:35:29,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:35:29,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:35:29,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:35:29,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:35:29,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:35:29,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:35:29,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:35:29,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:35:29,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:35:29,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:35:29,636 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-17 10:35:29,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:35:29,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:35:29,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:35:29,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:35:29,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:35:29,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:35:29,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:35:29,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:35:29,688 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:35:29,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:35:29,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:35:29,690 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-17 10:35:29,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:35:29,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:35:29,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:35:29,691 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-17 10:35:29,691 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-17 10:35:29,691 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-17 10:35:29,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:35:29,692 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-17 10:35:29,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:35:29,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:35:29,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:35:29,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:35:29,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:35:29,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:35:29,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:35:29,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:35:29,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:35:29,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:35:29,696 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_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/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_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2022-10-17 10:35:30,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:35:30,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:35:30,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:35:30,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:35:30,092 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:35:30,094 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-10-17 10:35:30,179 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/data/5e7d008e1/612fb1a3719b4581a95bb11b79eda474/FLAG0e4a67b6c [2022-10-17 10:35:30,756 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:35:30,757 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-10-17 10:35:30,775 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/data/5e7d008e1/612fb1a3719b4581a95bb11b79eda474/FLAG0e4a67b6c [2022-10-17 10:35:31,054 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/data/5e7d008e1/612fb1a3719b4581a95bb11b79eda474 [2022-10-17 10:35:31,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:35:31,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:35:31,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:35:31,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:35:31,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:35:31,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487879a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31, skipping insertion in model container [2022-10-17 10:35:31,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:35:31,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:35:31,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-10-17 10:35:31,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:35:31,643 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:35:31,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-10-17 10:35:31,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:35:31,790 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:35:31,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31 WrapperNode [2022-10-17 10:35:31,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:35:31,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:35:31,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:35:31,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:35:31,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,883 INFO L138 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2022-10-17 10:35:31,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:35:31,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:35:31,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:35:31,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:35:31,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,941 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:35:31,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:35:31,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:35:31,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:35:31,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (1/1) ... [2022-10-17 10:35:31,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:35:31,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:31,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:35:32,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:35:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-17 10:35:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-17 10:35:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-17 10:35:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:35:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:35:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-17 10:35:32,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-17 10:35:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:35:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-17 10:35:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:35:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:35:32,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:35:32,269 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:35:32,272 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:35:32,315 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-17 10:35:32,910 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:35:32,919 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:35:32,920 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-10-17 10:35:32,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:35:32 BoogieIcfgContainer [2022-10-17 10:35:32,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:35:32,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:35:32,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:35:32,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:35:32,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:35:31" (1/3) ... [2022-10-17 10:35:32,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1014dc73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:35:32, skipping insertion in model container [2022-10-17 10:35:32,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:35:31" (2/3) ... [2022-10-17 10:35:32,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1014dc73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:35:32, skipping insertion in model container [2022-10-17 10:35:32,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:35:32" (3/3) ... [2022-10-17 10:35:32,941 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2022-10-17 10:35:32,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:35:32,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-10-17 10:35:33,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:35:33,037 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;@7c78dd4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:35:33,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-10-17 10:35:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-17 10:35:33,050 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:33,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-17 10:35:33,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1083078, now seen corresponding path program 1 times [2022-10-17 10:35:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:33,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644180799] [2022-10-17 10:35:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:33,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:33,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:33,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644180799] [2022-10-17 10:35:33,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644180799] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:33,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:33,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:35:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980453636] [2022-10-17 10:35:33,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:33,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-17 10:35:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:33,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-17 10:35:33,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-17 10:35:33,280 INFO L87 Difference]: Start difference. First operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10-17 10:35:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:33,324 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-10-17 10:35:33,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-17 10:35:33,326 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-10-17 10:35:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:33,338 INFO L225 Difference]: With dead ends: 117 [2022-10-17 10:35:33,338 INFO L226 Difference]: Without dead ends: 111 [2022-10-17 10:35:33,341 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-10-17 10:35:33,349 INFO L413 NwaCegarLoop]: 132 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, 132 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-10-17 10:35:33,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:35:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-10-17 10:35:33,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-10-17 10:35:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 110 states have internal predecessors, (124), 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-10-17 10:35:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2022-10-17 10:35:33,412 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 4 [2022-10-17 10:35:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:33,413 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2022-10-17 10:35:33,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-10-17 10:35:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2022-10-17 10:35:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-17 10:35:33,415 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:33,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-17 10:35:33,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:35:33,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1079730, now seen corresponding path program 1 times [2022-10-17 10:35:33,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:33,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304424122] [2022-10-17 10:35:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:33,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:33,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304424122] [2022-10-17 10:35:33,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304424122] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:33,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:33,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:35:33,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96643693] [2022-10-17 10:35:33,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:33,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:35:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:35:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:35:33,623 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-17 10:35:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:33,802 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-10-17 10:35:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:35:33,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-10-17 10:35:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:33,805 INFO L225 Difference]: With dead ends: 136 [2022-10-17 10:35:33,806 INFO L226 Difference]: Without dead ends: 136 [2022-10-17 10:35:33,807 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-10-17 10:35:33,809 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:33,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 99 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-10-17 10:35:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2022-10-17 10:35:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 108 states have internal predecessors, (122), 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-10-17 10:35:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2022-10-17 10:35:33,853 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 4 [2022-10-17 10:35:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:33,854 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2022-10-17 10:35:33,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-17 10:35:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2022-10-17 10:35:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-17 10:35:33,857 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:33,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-17 10:35:33,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:35:33,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1079731, now seen corresponding path program 1 times [2022-10-17 10:35:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:33,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571174608] [2022-10-17 10:35:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:33,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:33,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:33,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571174608] [2022-10-17 10:35:33,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571174608] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:33,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:33,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:35:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009188926] [2022-10-17 10:35:33,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:33,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:35:33,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:33,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:35:33,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:35:33,987 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-17 10:35:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:34,049 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2022-10-17 10:35:34,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:35:34,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-10-17 10:35:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:34,052 INFO L225 Difference]: With dead ends: 157 [2022-10-17 10:35:34,055 INFO L226 Difference]: Without dead ends: 157 [2022-10-17 10:35:34,056 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-10-17 10:35:34,058 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:34,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:35:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-10-17 10:35:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2022-10-17 10:35:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 109 states have internal predecessors, (123), 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-10-17 10:35:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2022-10-17 10:35:34,085 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 4 [2022-10-17 10:35:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:34,086 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2022-10-17 10:35:34,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-10-17 10:35:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-10-17 10:35:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-17 10:35:34,089 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:34,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:34,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:35:34,090 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -336207078, now seen corresponding path program 1 times [2022-10-17 10:35:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:34,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199484866] [2022-10-17 10:35:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:34,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:34,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199484866] [2022-10-17 10:35:34,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199484866] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:35:34,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948157393] [2022-10-17 10:35:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:34,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:34,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:35:34,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-17 10:35:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:34,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-17 10:35:34,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:35:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:34,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:35:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:34,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948157393] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:35:34,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:35:34,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-17 10:35:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551172418] [2022-10-17 10:35:34,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:35:34,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:35:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:35:34,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:35:34,538 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:34,643 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2022-10-17 10:35:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:35:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-17 10:35:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:34,649 INFO L225 Difference]: With dead ends: 244 [2022-10-17 10:35:34,649 INFO L226 Difference]: Without dead ends: 244 [2022-10-17 10:35:34,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:35:34,659 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 319 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:34,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 603 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-10-17 10:35:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 173. [2022-10-17 10:35:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.7518796992481203) internal successors, (233), 172 states have internal predecessors, (233), 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-10-17 10:35:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2022-10-17 10:35:34,688 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 9 [2022-10-17 10:35:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:34,688 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2022-10-17 10:35:34,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-10-17 10:35:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-17 10:35:34,691 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:34,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:34,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-17 10:35:34,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:34,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash -991177183, now seen corresponding path program 1 times [2022-10-17 10:35:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:34,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000939297] [2022-10-17 10:35:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:35,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000939297] [2022-10-17 10:35:35,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000939297] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:35,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:35,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:35:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238291503] [2022-10-17 10:35:35,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:35,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:35:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:35,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:35:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:35:35,047 INFO L87 Difference]: Start difference. First operand 173 states and 233 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-10-17 10:35:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:35,189 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2022-10-17 10:35:35,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:35:35,191 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-10-17 10:35:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:35,193 INFO L225 Difference]: With dead ends: 329 [2022-10-17 10:35:35,193 INFO L226 Difference]: Without dead ends: 329 [2022-10-17 10:35:35,198 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-10-17 10:35:35,200 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 111 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:35,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-10-17 10:35:35,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 172. [2022-10-17 10:35:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.7293233082706767) internal successors, (230), 171 states have internal predecessors, (230), 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-10-17 10:35:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2022-10-17 10:35:35,221 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 11 [2022-10-17 10:35:35,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:35,221 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2022-10-17 10:35:35,221 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-10-17 10:35:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2022-10-17 10:35:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-17 10:35:35,222 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:35,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:35,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:35:35,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:35,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:35,223 INFO L85 PathProgramCache]: Analyzing trace with hash -991177182, now seen corresponding path program 1 times [2022-10-17 10:35:35,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:35,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054497523] [2022-10-17 10:35:35,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:35,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:35,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:35,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054497523] [2022-10-17 10:35:35,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054497523] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:35,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:35,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:35:35,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959508671] [2022-10-17 10:35:35,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:35,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:35:35,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:35,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:35:35,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:35:35,333 INFO L87 Difference]: Start difference. First operand 172 states and 230 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-10-17 10:35:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:35,518 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2022-10-17 10:35:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:35:35,519 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-10-17 10:35:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:35,521 INFO L225 Difference]: With dead ends: 330 [2022-10-17 10:35:35,521 INFO L226 Difference]: Without dead ends: 330 [2022-10-17 10:35:35,521 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-10-17 10:35:35,522 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:35,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 10:35:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-10-17 10:35:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 171. [2022-10-17 10:35:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 170 states have internal predecessors, (227), 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-10-17 10:35:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2022-10-17 10:35:35,530 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 11 [2022-10-17 10:35:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:35,530 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2022-10-17 10:35:35,530 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-10-17 10:35:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2022-10-17 10:35:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-17 10:35:35,531 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:35,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:35,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:35:35,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:35,532 INFO L85 PathProgramCache]: Analyzing trace with hash -661772220, now seen corresponding path program 1 times [2022-10-17 10:35:35,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:35,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880601098] [2022-10-17 10:35:35,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:35,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:35,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:35,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880601098] [2022-10-17 10:35:35,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880601098] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:35,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:35,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:35:35,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966545388] [2022-10-17 10:35:35,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:35,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:35:35,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:35,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:35:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:35:35,584 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-17 10:35:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:35,671 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2022-10-17 10:35:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:35:35,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-10-17 10:35:35,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:35,674 INFO L225 Difference]: With dead ends: 244 [2022-10-17 10:35:35,674 INFO L226 Difference]: Without dead ends: 244 [2022-10-17 10:35:35,675 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-10-17 10:35:35,676 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:35,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 204 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-10-17 10:35:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 169. [2022-10-17 10:35:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 168 states have internal predecessors, (221), 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-10-17 10:35:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2022-10-17 10:35:35,685 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 12 [2022-10-17 10:35:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:35,686 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2022-10-17 10:35:35,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-17 10:35:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2022-10-17 10:35:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-17 10:35:35,688 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:35,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:35,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:35:35,689 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash -661772219, now seen corresponding path program 1 times [2022-10-17 10:35:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:35,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859735274] [2022-10-17 10:35:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:35,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:35,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859735274] [2022-10-17 10:35:35,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859735274] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:35,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:35,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:35:35,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101412026] [2022-10-17 10:35:35,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:35,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:35:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:35,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:35:35,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:35:35,807 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-10-17 10:35:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:35,918 INFO L93 Difference]: Finished difference Result 376 states and 459 transitions. [2022-10-17 10:35:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:35:35,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-10-17 10:35:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:35,923 INFO L225 Difference]: With dead ends: 376 [2022-10-17 10:35:35,923 INFO L226 Difference]: Without dead ends: 376 [2022-10-17 10:35:35,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:35:35,924 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 231 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:35,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 812 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-10-17 10:35:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 172. [2022-10-17 10:35:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 171 states have internal predecessors, (224), 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-10-17 10:35:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2022-10-17 10:35:35,936 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 12 [2022-10-17 10:35:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:35,936 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2022-10-17 10:35:35,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-10-17 10:35:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2022-10-17 10:35:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-17 10:35:35,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:35,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:35,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:35:35,939 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash -51661170, now seen corresponding path program 1 times [2022-10-17 10:35:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:35,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525025029] [2022-10-17 10:35:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:35,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:36,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525025029] [2022-10-17 10:35:36,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525025029] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:35:36,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976447257] [2022-10-17 10:35:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:36,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:36,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:36,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:35:36,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-17 10:35:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:36,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-17 10:35:36,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:35:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:36,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:35:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:36,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976447257] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:35:36,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:35:36,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-10-17 10:35:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487075009] [2022-10-17 10:35:36,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:35:36,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 10:35:36,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 10:35:36,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:35:36,425 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:36,568 INFO L93 Difference]: Finished difference Result 391 states and 474 transitions. [2022-10-17 10:35:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 10:35:36,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-17 10:35:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:36,572 INFO L225 Difference]: With dead ends: 391 [2022-10-17 10:35:36,572 INFO L226 Difference]: Without dead ends: 391 [2022-10-17 10:35:36,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-10-17 10:35:36,576 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 477 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:36,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 814 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-10-17 10:35:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 196. [2022-10-17 10:35:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.55) internal successors, (248), 195 states have internal predecessors, (248), 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-10-17 10:35:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2022-10-17 10:35:36,585 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 16 [2022-10-17 10:35:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:36,585 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2022-10-17 10:35:36,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2022-10-17 10:35:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-17 10:35:36,587 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:36,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-10-17 10:35:36,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-17 10:35:36,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:36,808 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1254577850, now seen corresponding path program 2 times [2022-10-17 10:35:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:36,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962008117] [2022-10-17 10:35:36,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-17 10:35:36,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:36,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962008117] [2022-10-17 10:35:36,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962008117] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:36,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:36,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:35:36,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602398476] [2022-10-17 10:35:36,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:36,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:35:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:36,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:35:36,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:35:36,909 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:36,994 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2022-10-17 10:35:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:35:36,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-17 10:35:36,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:36,997 INFO L225 Difference]: With dead ends: 269 [2022-10-17 10:35:36,997 INFO L226 Difference]: Without dead ends: 269 [2022-10-17 10:35:36,998 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-10-17 10:35:36,998 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 63 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:37,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-10-17 10:35:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2022-10-17 10:35:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 232 states have internal predecessors, (306), 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-10-17 10:35:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2022-10-17 10:35:37,007 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 19 [2022-10-17 10:35:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:37,008 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2022-10-17 10:35:37,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2022-10-17 10:35:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-17 10:35:37,014 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:37,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:37,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 10:35:37,016 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:37,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1435011604, now seen corresponding path program 1 times [2022-10-17 10:35:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:37,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999221395] [2022-10-17 10:35:37,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:37,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-17 10:35:37,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:37,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999221395] [2022-10-17 10:35:37,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999221395] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:37,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:37,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:35:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822249554] [2022-10-17 10:35:37,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:37,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:35:37,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:37,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:35:37,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:35:37,145 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-17 10:35:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:37,240 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2022-10-17 10:35:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:35:37,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-17 10:35:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:37,243 INFO L225 Difference]: With dead ends: 260 [2022-10-17 10:35:37,243 INFO L226 Difference]: Without dead ends: 260 [2022-10-17 10:35:37,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:35:37,244 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 103 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:37,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 380 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-10-17 10:35:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 217. [2022-10-17 10:35:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 216 states have internal predecessors, (276), 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-10-17 10:35:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2022-10-17 10:35:37,251 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 23 [2022-10-17 10:35:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:37,252 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2022-10-17 10:35:37,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-17 10:35:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2022-10-17 10:35:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-17 10:35:37,254 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:37,255 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:37,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 10:35:37,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash 877276576, now seen corresponding path program 2 times [2022-10-17 10:35:37,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:37,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305959243] [2022-10-17 10:35:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:37,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-17 10:35:37,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:37,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305959243] [2022-10-17 10:35:37,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305959243] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:35:37,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618763476] [2022-10-17 10:35:37,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-17 10:35:37,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:37,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:37,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:35:37,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-17 10:35:37,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-17 10:35:37,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:35:37,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-17 10:35:37,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:35:37,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-17 10:35:37,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-17 10:35:37,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:37,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-17 10:35:37,928 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-17 10:35:37,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-17 10:35:37,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:37,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-17 10:35:37,999 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-17 10:35:37,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-17 10:35:38,084 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-17 10:35:38,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-17 10:35:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-17 10:35:38,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:35:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-17 10:35:38,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618763476] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:35:38,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:35:38,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 9 [2022-10-17 10:35:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743077051] [2022-10-17 10:35:38,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:35:38,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:35:38,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:35:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:35:38,834 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 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-10-17 10:35:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:38,969 INFO L93 Difference]: Finished difference Result 272 states and 330 transitions. [2022-10-17 10:35:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:35:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-17 10:35:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:38,972 INFO L225 Difference]: With dead ends: 272 [2022-10-17 10:35:38,972 INFO L226 Difference]: Without dead ends: 272 [2022-10-17 10:35:38,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-10-17 10:35:38,973 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 480 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:38,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 262 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-10-17 10:35:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-10-17 10:35:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 215. [2022-10-17 10:35:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 181 states have (on average 1.4917127071823204) internal successors, (270), 214 states have internal predecessors, (270), 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-10-17 10:35:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2022-10-17 10:35:38,979 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 24 [2022-10-17 10:35:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:38,980 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2022-10-17 10:35:38,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 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-10-17 10:35:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2022-10-17 10:35:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-17 10:35:38,981 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:38,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:39,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-17 10:35:39,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:39,212 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash 361607171, now seen corresponding path program 1 times [2022-10-17 10:35:39,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:39,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391503351] [2022-10-17 10:35:39,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:39,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-17 10:35:39,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391503351] [2022-10-17 10:35:39,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391503351] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:39,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:39,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:35:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807921889] [2022-10-17 10:35:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:39,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:35:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:39,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:35:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:35:39,299 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-17 10:35:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:39,382 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2022-10-17 10:35:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:35:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-17 10:35:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:39,385 INFO L225 Difference]: With dead ends: 233 [2022-10-17 10:35:39,385 INFO L226 Difference]: Without dead ends: 233 [2022-10-17 10:35:39,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:35:39,386 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 14 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:39,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 407 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-10-17 10:35:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 217. [2022-10-17 10:35:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 216 states have internal predecessors, (272), 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-10-17 10:35:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 272 transitions. [2022-10-17 10:35:39,393 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 272 transitions. Word has length 25 [2022-10-17 10:35:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:39,394 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 272 transitions. [2022-10-17 10:35:39,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-17 10:35:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 272 transitions. [2022-10-17 10:35:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-17 10:35:39,395 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:39,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:39,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-17 10:35:39,396 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1675080075, now seen corresponding path program 1 times [2022-10-17 10:35:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:39,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194791148] [2022-10-17 10:35:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-17 10:35:39,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:39,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194791148] [2022-10-17 10:35:39,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194791148] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:39,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:39,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:35:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662585559] [2022-10-17 10:35:39,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:39,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:35:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:35:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:35:39,484 INFO L87 Difference]: Start difference. First operand 217 states and 272 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-10-17 10:35:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:39,560 INFO L93 Difference]: Finished difference Result 219 states and 273 transitions. [2022-10-17 10:35:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 10:35:39,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-17 10:35:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:39,562 INFO L225 Difference]: With dead ends: 219 [2022-10-17 10:35:39,562 INFO L226 Difference]: Without dead ends: 211 [2022-10-17 10:35:39,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:35:39,563 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:39,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-10-17 10:35:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-10-17 10:35:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 175 states have (on average 1.502857142857143) internal successors, (263), 208 states have internal predecessors, (263), 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-10-17 10:35:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 263 transitions. [2022-10-17 10:35:39,570 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 263 transitions. Word has length 26 [2022-10-17 10:35:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:39,570 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 263 transitions. [2022-10-17 10:35:39,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-10-17 10:35:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 263 transitions. [2022-10-17 10:35:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-17 10:35:39,574 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:39,574 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:39,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-17 10:35:39,575 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:39,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash -981051253, now seen corresponding path program 1 times [2022-10-17 10:35:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:39,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725956945] [2022-10-17 10:35:39,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-17 10:35:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:39,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725956945] [2022-10-17 10:35:39,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725956945] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:39,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:39,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 10:35:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287576647] [2022-10-17 10:35:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:39,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:35:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:39,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:35:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:35:39,735 INFO L87 Difference]: Start difference. First operand 209 states and 263 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:39,860 INFO L93 Difference]: Finished difference Result 235 states and 289 transitions. [2022-10-17 10:35:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:35:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-17 10:35:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:39,865 INFO L225 Difference]: With dead ends: 235 [2022-10-17 10:35:39,865 INFO L226 Difference]: Without dead ends: 235 [2022-10-17 10:35:39,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:35:39,868 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 293 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:39,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 169 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-10-17 10:35:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 208. [2022-10-17 10:35:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 207 states have internal predecessors, (260), 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-10-17 10:35:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 260 transitions. [2022-10-17 10:35:39,875 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 260 transitions. Word has length 29 [2022-10-17 10:35:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:39,876 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 260 transitions. [2022-10-17 10:35:39,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 260 transitions. [2022-10-17 10:35:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-17 10:35:39,878 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:39,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:39,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-17 10:35:39,879 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:39,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:39,879 INFO L85 PathProgramCache]: Analyzing trace with hash -981051252, now seen corresponding path program 1 times [2022-10-17 10:35:39,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:39,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554707771] [2022-10-17 10:35:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-17 10:35:40,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:40,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554707771] [2022-10-17 10:35:40,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554707771] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:35:40,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:35:40,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:35:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924769471] [2022-10-17 10:35:40,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:35:40,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:35:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:35:40,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:35:40,119 INFO L87 Difference]: Start difference. First operand 208 states and 260 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:40,219 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2022-10-17 10:35:40,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:35:40,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-17 10:35:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:40,222 INFO L225 Difference]: With dead ends: 207 [2022-10-17 10:35:40,223 INFO L226 Difference]: Without dead ends: 207 [2022-10-17 10:35:40,223 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-10-17 10:35:40,224 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 305 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:40,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 126 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:35:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-10-17 10:35:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-10-17 10:35:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.4685714285714286) internal successors, (257), 206 states have internal predecessors, (257), 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-10-17 10:35:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2022-10-17 10:35:40,232 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 29 [2022-10-17 10:35:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:40,232 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2022-10-17 10:35:40,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:35:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2022-10-17 10:35:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-17 10:35:40,233 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:40,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:40,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-17 10:35:40,234 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:40,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:40,234 INFO L85 PathProgramCache]: Analyzing trace with hash -347817722, now seen corresponding path program 1 times [2022-10-17 10:35:40,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:40,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779690095] [2022-10-17 10:35:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-17 10:35:40,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:40,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779690095] [2022-10-17 10:35:40,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779690095] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:35:40,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944381679] [2022-10-17 10:35:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:40,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:40,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:40,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:35:40,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-17 10:35:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:40,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 22 conjunts are in the unsatisfiable core [2022-10-17 10:35:40,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:35:40,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-17 10:35:40,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:40,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-17 10:35:41,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:41,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-17 10:35:41,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:41,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-17 10:35:41,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:41,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-17 10:35:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-17 10:35:41,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:35:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-17 10:35:49,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944381679] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:35:49,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:35:49,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-10-17 10:35:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840940508] [2022-10-17 10:35:49,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:35:49,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-17 10:35:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-17 10:35:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-10-17 10:35:49,925 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 13 states, 12 states have (on average 6.666666666666667) internal successors, (80), 13 states have internal predecessors, (80), 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-10-17 10:35:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:50,109 INFO L93 Difference]: Finished difference Result 395 states and 483 transitions. [2022-10-17 10:35:50,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:35:50,110 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.666666666666667) internal successors, (80), 13 states have internal predecessors, (80), 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-10-17 10:35:50,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:50,113 INFO L225 Difference]: With dead ends: 395 [2022-10-17 10:35:50,113 INFO L226 Difference]: Without dead ends: 395 [2022-10-17 10:35:50,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-10-17 10:35:50,114 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 511 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:50,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 368 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2022-10-17 10:35:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-10-17 10:35:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 278. [2022-10-17 10:35:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 277 states have internal predecessors, (332), 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-10-17 10:35:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 332 transitions. [2022-10-17 10:35:50,127 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 332 transitions. Word has length 30 [2022-10-17 10:35:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:50,128 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 332 transitions. [2022-10-17 10:35:50,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.666666666666667) internal successors, (80), 13 states have internal predecessors, (80), 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-10-17 10:35:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 332 transitions. [2022-10-17 10:35:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-17 10:35:50,129 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:50,130 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:50,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-17 10:35:50,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-17 10:35:50,344 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:50,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash -347817723, now seen corresponding path program 1 times [2022-10-17 10:35:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:50,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143933081] [2022-10-17 10:35:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 10:35:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:50,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143933081] [2022-10-17 10:35:50,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143933081] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:35:50,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837203740] [2022-10-17 10:35:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:50,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:35:50,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-17 10:35:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:50,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-17 10:35:50,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:35:50,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-17 10:35:50,934 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-17 10:35:50,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-17 10:35:50,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:50,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-17 10:35:51,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:51,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-17 10:35:51,090 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-17 10:35:51,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-10-17 10:35:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-17 10:35:51,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:35:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-17 10:35:51,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837203740] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:35:51,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:35:51,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-10-17 10:35:51,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715816820] [2022-10-17 10:35:51,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:35:51,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-17 10:35:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-17 10:35:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-10-17 10:35:51,708 INFO L87 Difference]: Start difference. First operand 278 states and 332 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 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-10-17 10:35:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:35:51,861 INFO L93 Difference]: Finished difference Result 303 states and 352 transitions. [2022-10-17 10:35:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 10:35:51,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 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-10-17 10:35:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:35:51,864 INFO L225 Difference]: With dead ends: 303 [2022-10-17 10:35:51,864 INFO L226 Difference]: Without dead ends: 303 [2022-10-17 10:35:51,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-17 10:35:51,865 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 711 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:35:51,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 225 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-10-17 10:35:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-10-17 10:35:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 276. [2022-10-17 10:35:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.3076923076923077) internal successors, (323), 275 states have internal predecessors, (323), 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-10-17 10:35:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 323 transitions. [2022-10-17 10:35:51,873 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 323 transitions. Word has length 30 [2022-10-17 10:35:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:35:51,874 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 323 transitions. [2022-10-17 10:35:51,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 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-10-17 10:35:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 323 transitions. [2022-10-17 10:35:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-17 10:35:51,875 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:35:51,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:51,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-17 10:35:52,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-17 10:35:52,094 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:35:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1918350099, now seen corresponding path program 1 times [2022-10-17 10:35:52,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:52,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030408336] [2022-10-17 10:35:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-17 10:35:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030408336] [2022-10-17 10:35:52,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030408336] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:35:52,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504548906] [2022-10-17 10:35:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:52,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:52,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:52,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:35:52,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-17 10:35:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:53,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjunts are in the unsatisfiable core [2022-10-17 10:35:53,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:35:53,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:53,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:53,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:53,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-17 10:35:53,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,771 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-17 10:35:53,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-10-17 10:35:53,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:53,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:53,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:53,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:53,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:53,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:54,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:54,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:54,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:35:54,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:54,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-17 10:35:54,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-17 10:35:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:54,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:35:54,118 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2022-10-17 10:35:54,137 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-10-17 10:35:54,172 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (forall ((v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-10-17 10:35:54,197 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-10-17 10:35:54,338 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-10-17 10:35:54,400 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) is different from false [2022-10-17 10:35:54,488 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|))))) is different from false [2022-10-17 10:35:54,612 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|))))) is different from false [2022-10-17 10:35:54,700 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|))))) is different from false [2022-10-17 10:35:54,807 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|))))) is different from false [2022-10-17 10:35:55,021 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|))))) is different from false [2022-10-17 10:35:55,399 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))))))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|))))) is different from false [2022-10-17 10:35:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-10-17 10:35:55,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504548906] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:35:55,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:35:55,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 17] total 36 [2022-10-17 10:35:55,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413038523] [2022-10-17 10:35:55,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:35:55,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-10-17 10:35:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:55,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-10-17 10:35:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=450, Unknown=12, NotChecked=660, Total=1260 [2022-10-17 10:35:55,935 INFO L87 Difference]: Start difference. First operand 276 states and 323 transitions. Second operand has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 states have internal predecessors, (86), 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-10-17 10:35:55,969 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))))))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-10-17 10:35:55,988 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-10-17 10:35:56,000 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-10-17 10:35:58,008 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-10-17 10:36:00,015 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-10-17 10:36:02,087 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-10-17 10:36:04,092 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-10-17 10:36:04,383 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (<= (+ 2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0)) is different from false [2022-10-17 10:36:04,388 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-10-17 10:36:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:36:04,582 INFO L93 Difference]: Finished difference Result 313 states and 362 transitions. [2022-10-17 10:36:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-17 10:36:04,582 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 states have internal predecessors, (86), 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 33 [2022-10-17 10:36:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:36:04,584 INFO L225 Difference]: With dead ends: 313 [2022-10-17 10:36:04,584 INFO L226 Difference]: Without dead ends: 313 [2022-10-17 10:36:04,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=205, Invalid=670, Unknown=21, NotChecked=1554, Total=2450 [2022-10-17 10:36:04,586 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 390 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:36:04,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1321 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 150 Invalid, 0 Unknown, 390 Unchecked, 0.2s Time] [2022-10-17 10:36:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-10-17 10:36:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2022-10-17 10:36:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 274 states have (on average 1.2846715328467153) internal successors, (352), 302 states have internal predecessors, (352), 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-10-17 10:36:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2022-10-17 10:36:04,595 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 33 [2022-10-17 10:36:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:36:04,596 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2022-10-17 10:36:04,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 states have internal predecessors, (86), 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-10-17 10:36:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2022-10-17 10:36:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-17 10:36:04,597 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:36:04,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:36:04,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-17 10:36:04,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:36:04,824 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:36:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash -990413803, now seen corresponding path program 1 times [2022-10-17 10:36:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:04,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532823929] [2022-10-17 10:36:04,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:04,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-17 10:36:04,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:04,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532823929] [2022-10-17 10:36:04,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532823929] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:36:04,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:36:04,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:36:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069705125] [2022-10-17 10:36:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:36:04,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:36:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:04,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:36:04,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:36:04,893 INFO L87 Difference]: Start difference. First operand 303 states and 352 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:36:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:36:04,905 INFO L93 Difference]: Finished difference Result 284 states and 331 transitions. [2022-10-17 10:36:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:36:04,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-17 10:36:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:36:04,909 INFO L225 Difference]: With dead ends: 284 [2022-10-17 10:36:04,909 INFO L226 Difference]: Without dead ends: 284 [2022-10-17 10:36:04,909 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-10-17 10:36:04,910 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:36:04,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:36:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-10-17 10:36:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2022-10-17 10:36:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 254 states have (on average 1.2992125984251968) internal successors, (330), 282 states have internal predecessors, (330), 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-10-17 10:36:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 330 transitions. [2022-10-17 10:36:04,920 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 330 transitions. Word has length 33 [2022-10-17 10:36:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:36:04,921 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 330 transitions. [2022-10-17 10:36:04,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:36:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 330 transitions. [2022-10-17 10:36:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-17 10:36:04,922 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:36:04,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:36:04,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-17 10:36:04,922 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:36:04,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash 74446604, now seen corresponding path program 1 times [2022-10-17 10:36:04,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:04,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836437802] [2022-10-17 10:36:04,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:05,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:36:05,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836437802] [2022-10-17 10:36:05,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836437802] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:36:05,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64640875] [2022-10-17 10:36:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:05,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:36:05,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:36:05,112 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:36:05,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-17 10:36:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:36:05,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-17 10:36:05,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:36:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:05,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:36:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:36:05,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64640875] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:36:05,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:36:05,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2022-10-17 10:36:05,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447863905] [2022-10-17 10:36:05,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:36:05,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-17 10:36:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:36:05,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-17 10:36:05,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-10-17 10:36:05,403 INFO L87 Difference]: Start difference. First operand 283 states and 330 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-10-17 10:36:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:36:05,585 INFO L93 Difference]: Finished difference Result 502 states and 569 transitions. [2022-10-17 10:36:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:36:05,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2022-10-17 10:36:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:36:05,589 INFO L225 Difference]: With dead ends: 502 [2022-10-17 10:36:05,589 INFO L226 Difference]: Without dead ends: 502 [2022-10-17 10:36:05,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-10-17 10:36:05,590 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 341 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:36:05,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 926 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:36:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-10-17 10:36:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 317. [2022-10-17 10:36:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 288 states have (on average 1.3090277777777777) internal successors, (377), 316 states have internal predecessors, (377), 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-10-17 10:36:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 377 transitions. [2022-10-17 10:36:05,603 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 377 transitions. Word has length 38 [2022-10-17 10:36:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:36:05,604 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 377 transitions. [2022-10-17 10:36:05,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-10-17 10:36:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 377 transitions. [2022-10-17 10:36:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-17 10:36:05,605 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:36:05,605 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:36:05,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-17 10:36:05,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dd99818-518e-4bab-b2dc-b9417561c9a0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-10-17 10:36:05,832 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-17 10:36:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:36:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1481327645, now seen corresponding path program 2 times [2022-10-17 10:36:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:36:05,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416202530] [2022-10-17 10:36:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:36:05,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:36:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat