./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- 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-b5237d8 [2022-11-21 16:12:14,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:12:14,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:12:14,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:12:14,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:12:14,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:12:14,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:12:14,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:12:14,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:12:14,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:12:14,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:12:14,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:12:14,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:12:14,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:12:14,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:12:14,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:12:14,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:12:14,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:12:14,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:12:14,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:12:14,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:12:14,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:12:14,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:12:14,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:12:14,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:12:14,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:12:14,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:12:14,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:12:14,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:12:14,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:12:14,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:12:14,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:12:14,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:12:14,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:12:14,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:12:14,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:12:14,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:12:14,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:12:14,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:12:14,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:12:14,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:12:14,076 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:12:14,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:12:14,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:12:14,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:12:14,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:12:14,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:12:14,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:12:14,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:12:14,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:12:14,103 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:12:14,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:12:14,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:12:14,104 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:12:14,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:12:14,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:12:14,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:12:14,105 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:12:14,105 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:12:14,106 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:12:14,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:12:14,106 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:12:14,107 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:12:14,107 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:12:14,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:12:14,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:12:14,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:12:14,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:12:14,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:12:14,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:12:14,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:12:14,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:12:14,110 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_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/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_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-21 16:12:14,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:12:14,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:12:14,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:12:14,487 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:12:14,487 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:12:14,489 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-21 16:12:17,609 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:12:17,903 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:12:17,907 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-21 16:12:17,924 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/data/a4cae8a3c/d74a2bfc208b416f8106628433c0db0a/FLAGb65e6b85a [2022-11-21 16:12:17,944 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/data/a4cae8a3c/d74a2bfc208b416f8106628433c0db0a [2022-11-21 16:12:17,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:12:17,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:12:17,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:12:17,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:12:17,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:12:17,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:12:17" (1/1) ... [2022-11-21 16:12:17,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53564006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:17, skipping insertion in model container [2022-11-21 16:12:17,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:12:17" (1/1) ... [2022-11-21 16:12:17,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:12:18,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:12:18,487 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-21 16:12:18,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:12:18,503 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:12:18,594 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-21 16:12:18,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:12:18,625 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:12:18,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18 WrapperNode [2022-11-21 16:12:18,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:12:18,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:12:18,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:12:18,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:12:18,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,679 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-11-21 16:12:18,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:12:18,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:12:18,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:12:18,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:12:18,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,711 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:12:18,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:12:18,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:12:18,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:12:18,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (1/1) ... [2022-11-21 16:12:18,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:12:18,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:18,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:12:18,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:12:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:12:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:12:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:12:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:12:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:12:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:12:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:12:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:12:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:12:18,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:12:18,973 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:12:18,976 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:12:19,363 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:12:19,372 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:12:19,372 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-21 16:12:19,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:12:19 BoogieIcfgContainer [2022-11-21 16:12:19,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:12:19,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:12:19,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:12:19,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:12:19,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:12:17" (1/3) ... [2022-11-21 16:12:19,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aba7cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:12:19, skipping insertion in model container [2022-11-21 16:12:19,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:12:18" (2/3) ... [2022-11-21 16:12:19,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aba7cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:12:19, skipping insertion in model container [2022-11-21 16:12:19,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:12:19" (3/3) ... [2022-11-21 16:12:19,399 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-21 16:12:19,420 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:12:19,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-21 16:12:19,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:12:19,479 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;@2769c606, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:12:19,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-21 16:12:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:12:19,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:19,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:12:19,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-11-21 16:12:19,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:19,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096723562] [2022-11-21 16:12:19,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:19,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:19,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:19,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096723562] [2022-11-21 16:12:19,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096723562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:19,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:12:19,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:12:19,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241858455] [2022-11-21 16:12:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:19,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:12:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:19,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:12:19,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:12:19,878 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:20,012 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-21 16:12:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:12:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:12:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:20,027 INFO L225 Difference]: With dead ends: 109 [2022-11-21 16:12:20,027 INFO L226 Difference]: Without dead ends: 104 [2022-11-21 16:12:20,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:12:20,034 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:20,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:12:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-21 16:12:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-21 16:12:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-21 16:12:20,083 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2022-11-21 16:12:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:20,084 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-21 16:12:20,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-21 16:12:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:12:20,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:20,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:12:20,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:12:20,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-11-21 16:12:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490933744] [2022-11-21 16:12:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:20,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:20,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490933744] [2022-11-21 16:12:20,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490933744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:20,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:12:20,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:12:20,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858317709] [2022-11-21 16:12:20,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:20,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:12:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:20,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:12:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:12:20,239 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:20,336 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-21 16:12:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:12:20,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-21 16:12:20,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:20,339 INFO L225 Difference]: With dead ends: 102 [2022-11-21 16:12:20,339 INFO L226 Difference]: Without dead ends: 102 [2022-11-21 16:12:20,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:12:20,341 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:20,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:12:20,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-21 16:12:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-11-21 16:12:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-21 16:12:20,352 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2022-11-21 16:12:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:20,353 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-21 16:12:20,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-21 16:12:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 16:12:20,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:20,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:20,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:12:20,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2022-11-21 16:12:20,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:20,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495597044] [2022-11-21 16:12:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:20,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:20,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495597044] [2022-11-21 16:12:20,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495597044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:20,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:12:20,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:12:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638071745] [2022-11-21 16:12:20,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:20,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:12:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:20,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:12:20,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:12:20,438 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:20,454 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-11-21 16:12:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:12:20,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-21 16:12:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:20,456 INFO L225 Difference]: With dead ends: 68 [2022-11-21 16:12:20,457 INFO L226 Difference]: Without dead ends: 68 [2022-11-21 16:12:20,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:12:20,459 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:20,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:12:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-21 16:12:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-21 16:12:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-21 16:12:20,468 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2022-11-21 16:12:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:20,469 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-21 16:12:20,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-21 16:12:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:12:20,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:20,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:20,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:12:20,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-11-21 16:12:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:20,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859176291] [2022-11-21 16:12:20,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:20,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:20,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:20,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859176291] [2022-11-21 16:12:20,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859176291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:20,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:12:20,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:12:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626984584] [2022-11-21 16:12:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:20,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:12:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:12:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:12:20,700 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-11-21 16:12:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:20,850 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-21 16:12:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:12:20,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 9 [2022-11-21 16:12:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:20,853 INFO L225 Difference]: With dead ends: 76 [2022-11-21 16:12:20,857 INFO L226 Difference]: Without dead ends: 76 [2022-11-21 16:12:20,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:12:20,860 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:20,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:12:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-21 16:12:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-11-21 16:12:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-21 16:12:20,881 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2022-11-21 16:12:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:20,882 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-21 16:12:20,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-11-21 16:12:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-21 16:12:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:12:20,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:20,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:20,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:12:20,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:20,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-11-21 16:12:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:20,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258653181] [2022-11-21 16:12:20,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:21,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:21,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258653181] [2022-11-21 16:12:21,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258653181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:21,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:12:21,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:12:21,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966726042] [2022-11-21 16:12:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:21,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:12:21,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:21,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:12:21,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:12:21,188 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-11-21 16:12:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:21,331 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-21 16:12:21,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:12:21,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 9 [2022-11-21 16:12:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:21,339 INFO L225 Difference]: With dead ends: 61 [2022-11-21 16:12:21,339 INFO L226 Difference]: Without dead ends: 61 [2022-11-21 16:12:21,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:12:21,345 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:21,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:12:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-21 16:12:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-21 16:12:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-21 16:12:21,360 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2022-11-21 16:12:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:21,361 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-21 16:12:21,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-11-21 16:12:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-21 16:12:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:12:21,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:21,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:21,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:12:21,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2022-11-21 16:12:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:21,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863609742] [2022-11-21 16:12:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:21,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:21,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863609742] [2022-11-21 16:12:21,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863609742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108721244] [2022-11-21 16:12:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:21,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:21,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:21,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:21,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:12:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:21,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:12:21,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:21,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:12:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:21,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108721244] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:12:21,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:12:21,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-21 16:12:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022737102] [2022-11-21 16:12:21,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:12:21,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:12:21,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:21,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:12:21,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:12:21,850 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:21,878 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-21 16:12:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:12:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:12:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:21,879 INFO L225 Difference]: With dead ends: 65 [2022-11-21 16:12:21,880 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 16:12:21,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:12:21,887 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:21,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:12:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 16:12:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-21 16:12:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-21 16:12:21,907 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2022-11-21 16:12:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:21,907 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-21 16:12:21,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-21 16:12:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 16:12:21,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:21,909 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:21,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:22,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:22,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:22,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2022-11-21 16:12:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:22,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008698935] [2022-11-21 16:12:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:12:22,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:22,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008698935] [2022-11-21 16:12:22,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008698935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:22,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:12:22,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:12:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511947200] [2022-11-21 16:12:22,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:22,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:12:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:12:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:12:22,446 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:22,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:22,803 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-21 16:12:22,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:12:22,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-21 16:12:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:22,805 INFO L225 Difference]: With dead ends: 116 [2022-11-21 16:12:22,805 INFO L226 Difference]: Without dead ends: 116 [2022-11-21 16:12:22,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:12:22,807 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 380 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:22,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 141 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:12:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-21 16:12:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-11-21 16:12:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-21 16:12:22,813 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2022-11-21 16:12:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:22,813 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-21 16:12:22,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-21 16:12:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 16:12:22,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:22,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:22,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:12:22,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:22,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2022-11-21 16:12:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:22,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524188688] [2022-11-21 16:12:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:12:23,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:23,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524188688] [2022-11-21 16:12:23,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524188688] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:23,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064647951] [2022-11-21 16:12:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:23,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:23,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:23,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:23,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:12:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:23,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:12:23,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 16:12:23,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:12:23,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064647951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:23,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:12:23,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-21 16:12:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144435984] [2022-11-21 16:12:23,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:23,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:12:23,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:12:23,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:12:23,193 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:23,247 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-11-21 16:12:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:12:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-21 16:12:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:23,249 INFO L225 Difference]: With dead ends: 96 [2022-11-21 16:12:23,249 INFO L226 Difference]: Without dead ends: 96 [2022-11-21 16:12:23,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:12:23,250 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 110 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:23,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 151 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:12:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-21 16:12:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-21 16:12:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-21 16:12:23,255 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2022-11-21 16:12:23,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:23,255 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-21 16:12:23,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-21 16:12:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 16:12:23,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:23,257 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:23,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:23,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:23,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2022-11-21 16:12:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:23,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338787581] [2022-11-21 16:12:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:12:23,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:23,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338787581] [2022-11-21 16:12:23,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338787581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:23,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:12:23,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:12:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460462079] [2022-11-21 16:12:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:23,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:12:23,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:23,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:12:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:12:23,816 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:24,215 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-11-21 16:12:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:12:24,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-21 16:12:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:24,217 INFO L225 Difference]: With dead ends: 107 [2022-11-21 16:12:24,217 INFO L226 Difference]: Without dead ends: 107 [2022-11-21 16:12:24,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:12:24,218 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 366 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:24,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:12:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-21 16:12:24,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2022-11-21 16:12:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-21 16:12:24,225 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2022-11-21 16:12:24,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:24,225 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-21 16:12:24,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-21 16:12:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 16:12:24,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:24,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:24,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:12:24,228 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:24,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2022-11-21 16:12:24,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:24,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649251312] [2022-11-21 16:12:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:24,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:25,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:25,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649251312] [2022-11-21 16:12:25,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649251312] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:25,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053971050] [2022-11-21 16:12:25,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:25,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:25,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:25,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:12:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:25,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-21 16:12:25,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:25,480 INFO L350 Elim1Store]: Elim1 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-11-21 16:12:25,561 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:12:25,561 INFO L350 Elim1Store]: Elim1 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-11-21 16:12:25,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-21 16:12:25,982 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 9 [2022-11-21 16:12:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:26,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:12:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:26,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053971050] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:12:26,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:12:26,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-11-21 16:12:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123997566] [2022-11-21 16:12:26,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:12:26,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-21 16:12:26,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:26,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-21 16:12:26,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-11-21 16:12:26,443 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:28,151 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-11-21 16:12:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 16:12:28,152 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 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-11-21 16:12:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:28,154 INFO L225 Difference]: With dead ends: 105 [2022-11-21 16:12:28,155 INFO L226 Difference]: Without dead ends: 105 [2022-11-21 16:12:28,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2022-11-21 16:12:28,157 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 833 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:28,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 491 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:12:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-21 16:12:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2022-11-21 16:12:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-21 16:12:28,163 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2022-11-21 16:12:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:28,164 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-21 16:12:28,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-21 16:12:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 16:12:28,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:28,166 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:28,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 16:12:28,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 16:12:28,373 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:28,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2022-11-21 16:12:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:28,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820321702] [2022-11-21 16:12:28,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:28,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:29,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:29,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820321702] [2022-11-21 16:12:29,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820321702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:29,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962533528] [2022-11-21 16:12:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:29,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:29,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:29,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:12:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:29,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-21 16:12:29,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:29,577 INFO L350 Elim1Store]: Elim1 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-11-21 16:12:29,838 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:12:29,838 INFO L350 Elim1Store]: Elim1 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-11-21 16:12:29,847 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-11-21 16:12:30,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:12:30,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-21 16:12:30,455 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 21 [2022-11-21 16:12:30,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2022-11-21 16:12:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:30,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:12:31,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 44 [2022-11-21 16:12:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:12:32,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962533528] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:12:32,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:12:32,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 43 [2022-11-21 16:12:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128305877] [2022-11-21 16:12:32,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:12:32,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-21 16:12:32,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:32,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-21 16:12:32,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2022-11-21 16:12:32,113 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:38,165 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2022-11-21 16:12:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 16:12:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-21 16:12:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:38,167 INFO L225 Difference]: With dead ends: 213 [2022-11-21 16:12:38,167 INFO L226 Difference]: Without dead ends: 213 [2022-11-21 16:12:38,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=818, Invalid=3738, Unknown=0, NotChecked=0, Total=4556 [2022-11-21 16:12:38,169 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2932 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2932 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:38,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2932 Valid, 904 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 16:12:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-21 16:12:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2022-11-21 16:12:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.391304347826087) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-11-21 16:12:38,174 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2022-11-21 16:12:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:38,174 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-11-21 16:12:38,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-11-21 16:12:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 16:12:38,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:38,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:38,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:38,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 16:12:38,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2022-11-21 16:12:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:38,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893112228] [2022-11-21 16:12:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:38,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:12:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:38,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893112228] [2022-11-21 16:12:38,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893112228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:38,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046076604] [2022-11-21 16:12:38,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:12:38,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:38,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:38,559 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:38,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:12:38,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:12:38,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:12:38,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:12:38,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 16:12:38,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:12:38,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046076604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:38,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:12:38,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-21 16:12:38,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914473007] [2022-11-21 16:12:38,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:38,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:12:38,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:38,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:12:38,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:12:38,737 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:38,780 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-21 16:12:38,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:12:38,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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 32 [2022-11-21 16:12:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:38,782 INFO L225 Difference]: With dead ends: 70 [2022-11-21 16:12:38,782 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 16:12:38,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:12:38,783 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 165 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:38,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:12:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 16:12:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-21 16:12:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 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-11-21 16:12:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-21 16:12:38,787 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2022-11-21 16:12:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:38,787 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-21 16:12:38,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-21 16:12:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:12:38,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:38,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:38,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-21 16:12:38,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:38,995 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2022-11-21 16:12:38,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:38,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974464224] [2022-11-21 16:12:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:38,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:12:39,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:39,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974464224] [2022-11-21 16:12:39,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974464224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:39,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:12:39,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:12:39,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832485462] [2022-11-21 16:12:39,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:39,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:12:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:12:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:12:39,144 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:39,356 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-21 16:12:39,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:12:39,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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 36 [2022-11-21 16:12:39,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:39,358 INFO L225 Difference]: With dead ends: 89 [2022-11-21 16:12:39,358 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 16:12:39,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:12:39,359 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 338 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:39,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 109 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:12:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 16:12:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2022-11-21 16:12:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-11-21 16:12:39,362 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2022-11-21 16:12:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:39,362 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-11-21 16:12:39,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-11-21 16:12:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:12:39,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:39,363 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:39,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:12:39,363 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:39,364 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2022-11-21 16:12:39,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:39,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985609480] [2022-11-21 16:12:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:39,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:12:39,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:39,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985609480] [2022-11-21 16:12:39,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985609480] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:39,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170034506] [2022-11-21 16:12:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:39,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:39,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:39,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:39,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:12:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:39,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:12:39,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:12:39,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:12:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:12:39,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170034506] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:12:39,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:12:39,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-21 16:12:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913602422] [2022-11-21 16:12:39,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:12:39,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:12:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:12:39,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:12:39,762 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:39,827 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-11-21 16:12:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:12:39,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 36 [2022-11-21 16:12:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:39,829 INFO L225 Difference]: With dead ends: 95 [2022-11-21 16:12:39,830 INFO L226 Difference]: Without dead ends: 95 [2022-11-21 16:12:39,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:12:39,831 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 130 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:39,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 143 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:12:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-21 16:12:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-11-21 16:12:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 88 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2022-11-21 16:12:39,834 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2022-11-21 16:12:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:39,835 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2022-11-21 16:12:39,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-11-21 16:12:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 16:12:39,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:39,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:39,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:40,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:40,047 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:40,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2022-11-21 16:12:40,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:40,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691298333] [2022-11-21 16:12:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:12:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:40,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691298333] [2022-11-21 16:12:40,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691298333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:40,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927185231] [2022-11-21 16:12:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:40,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:40,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:40,227 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:40,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:12:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:40,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:12:40,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:12:40,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:12:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:12:40,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927185231] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:12:40,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:12:40,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-21 16:12:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246904960] [2022-11-21 16:12:40,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:12:40,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:12:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:12:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:12:40,529 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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-11-21 16:12:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:40,593 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-11-21 16:12:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:12:40,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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 37 [2022-11-21 16:12:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:40,595 INFO L225 Difference]: With dead ends: 90 [2022-11-21 16:12:40,595 INFO L226 Difference]: Without dead ends: 90 [2022-11-21 16:12:40,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:12:40,596 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 148 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:40,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 165 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:12:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-21 16:12:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-11-21 16:12:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.36986301369863) internal successors, (100), 83 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-11-21 16:12:40,599 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2022-11-21 16:12:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:40,600 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-11-21 16:12:40,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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-11-21 16:12:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-11-21 16:12:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 16:12:40,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:40,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:40,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:40,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 16:12:40,807 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:40,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2022-11-21 16:12:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:40,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156878353] [2022-11-21 16:12:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:12:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:41,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156878353] [2022-11-21 16:12:41,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156878353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:41,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092210869] [2022-11-21 16:12:41,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:12:41,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:41,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:41,037 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:41,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:12:41,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:12:41,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:12:41,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:12:41,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 16:12:41,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:12:41,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092210869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:41,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:12:41,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-21 16:12:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489567394] [2022-11-21 16:12:41,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:41,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:12:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:41,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:12:41,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:12:41,238 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:41,285 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-21 16:12:41,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:12:41,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-21 16:12:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:41,286 INFO L225 Difference]: With dead ends: 89 [2022-11-21 16:12:41,286 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 16:12:41,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:12:41,287 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:41,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 136 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:12:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 16:12:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-11-21 16:12:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-11-21 16:12:41,293 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2022-11-21 16:12:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:41,293 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-11-21 16:12:41,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-11-21 16:12:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 16:12:41,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:41,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:41,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:41,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 16:12:41,500 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2022-11-21 16:12:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:41,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102975226] [2022-11-21 16:12:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:12:41,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:41,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102975226] [2022-11-21 16:12:41,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102975226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:41,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:12:41,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:12:41,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447170240] [2022-11-21 16:12:41,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:41,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:12:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:41,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:12:41,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:12:41,804 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:42,071 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-11-21 16:12:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:12:42,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 41 [2022-11-21 16:12:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:42,073 INFO L225 Difference]: With dead ends: 107 [2022-11-21 16:12:42,073 INFO L226 Difference]: Without dead ends: 107 [2022-11-21 16:12:42,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:12:42,074 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 414 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:42,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 80 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:12:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-21 16:12:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2022-11-21 16:12:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-21 16:12:42,076 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2022-11-21 16:12:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:42,077 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-21 16:12:42,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-21 16:12:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 16:12:42,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:42,078 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:42,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:12:42,078 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:42,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2022-11-21 16:12:42,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:42,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522481336] [2022-11-21 16:12:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:12:43,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:43,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522481336] [2022-11-21 16:12:43,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522481336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:43,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852574550] [2022-11-21 16:12:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:43,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:43,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:43,499 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:43,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 16:12:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:43,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-21 16:12:43,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:43,693 INFO L350 Elim1Store]: Elim1 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-11-21 16:12:43,749 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:12:43,749 INFO L350 Elim1Store]: Elim1 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-11-21 16:12:43,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:12:43,930 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:12:43,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 16:12:44,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:12:44,133 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2022-11-21 16:12:44,232 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 13 [2022-11-21 16:12:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:12:44,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:12:44,487 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-21 16:12:44,487 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-21 16:12:44,608 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-11-21 16:12:44,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2022-11-21 16:12:44,709 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) is different from false [2022-11-21 16:12:44,810 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1) .cse0)))) is different from false [2022-11-21 16:12:44,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:12:44,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 23 [2022-11-21 16:12:44,826 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 24 [2022-11-21 16:12:44,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2022-11-21 16:12:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-21 16:12:45,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852574550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:12:45,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:12:45,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-11-21 16:12:45,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13241699] [2022-11-21 16:12:45,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:12:45,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-21 16:12:45,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:45,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-21 16:12:45,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1352, Unknown=29, NotChecked=308, Total=1806 [2022-11-21 16:12:45,095 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:47,726 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-11-21 16:12:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 16:12:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 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 44 [2022-11-21 16:12:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:47,727 INFO L225 Difference]: With dead ends: 136 [2022-11-21 16:12:47,727 INFO L226 Difference]: Without dead ends: 136 [2022-11-21 16:12:47,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=661, Invalid=3358, Unknown=29, NotChecked=508, Total=4556 [2022-11-21 16:12:47,729 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1124 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:47,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 689 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 928 Invalid, 0 Unknown, 367 Unchecked, 0.8s Time] [2022-11-21 16:12:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-21 16:12:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2022-11-21 16:12:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-11-21 16:12:47,732 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2022-11-21 16:12:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:47,734 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-11-21 16:12:47,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.261904761904762) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-11-21 16:12:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 16:12:47,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:47,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:47,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:47,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 16:12:47,942 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:47,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:47,943 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2022-11-21 16:12:47,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:47,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675934027] [2022-11-21 16:12:47,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:47,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:12:49,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:49,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675934027] [2022-11-21 16:12:49,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675934027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:49,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313993936] [2022-11-21 16:12:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:49,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:49,671 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:49,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 16:12:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:49,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-21 16:12:49,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:49,928 INFO L350 Elim1Store]: Elim1 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-11-21 16:12:50,127 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:12:50,127 INFO L350 Elim1Store]: Elim1 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-11-21 16:12:50,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-21 16:12:50,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:12:50,746 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:12:50,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-21 16:12:50,753 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 41 [2022-11-21 16:12:50,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:12:50,977 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 33 [2022-11-21 16:12:50,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:12:50,987 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 34 [2022-11-21 16:12:51,129 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 21 [2022-11-21 16:12:51,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2022-11-21 16:12:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:12:51,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:12:51,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:12:51,927 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 51 [2022-11-21 16:12:51,972 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1))) (forall ((v_ArrVal_1089 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2022-11-21 16:12:52,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1089 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2022-11-21 16:12:52,031 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) 1))) (forall ((v_ArrVal_1089 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-11-21 16:12:52,059 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1089 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1088 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2022-11-21 16:12:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-21 16:12:52,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313993936] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:12:52,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:12:52,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 51 [2022-11-21 16:12:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184337902] [2022-11-21 16:12:52,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:12:52,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-21 16:12:52,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:52,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-21 16:12:52,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2111, Unknown=4, NotChecked=380, Total=2652 [2022-11-21 16:12:52,785 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:58,101 INFO L93 Difference]: Finished difference Result 191 states and 207 transitions. [2022-11-21 16:12:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 16:12:58,102 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 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 44 [2022-11-21 16:12:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:58,103 INFO L225 Difference]: With dead ends: 191 [2022-11-21 16:12:58,103 INFO L226 Difference]: Without dead ends: 191 [2022-11-21 16:12:58,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=892, Invalid=4820, Unknown=4, NotChecked=604, Total=6320 [2022-11-21 16:12:58,105 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1434 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 586 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:58,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 1010 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1312 Invalid, 0 Unknown, 586 Unchecked, 1.1s Time] [2022-11-21 16:12:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-21 16:12:58,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 90. [2022-11-21 16:12:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:58,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-11-21 16:12:58,110 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2022-11-21 16:12:58,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:58,110 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-11-21 16:12:58,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-11-21 16:12:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 16:12:58,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:58,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:58,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:58,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:58,317 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2022-11-21 16:12:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:58,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009890519] [2022-11-21 16:12:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:58,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:12:58,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:58,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009890519] [2022-11-21 16:12:58,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009890519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:58,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091153747] [2022-11-21 16:12:58,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:12:58,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:58,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:58,478 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:58,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 16:12:58,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:12:58,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:12:58,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:12:58,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 16:12:58,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:12:58,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091153747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:12:58,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:12:58,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-21 16:12:58,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138645953] [2022-11-21 16:12:58,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:12:58,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:12:58,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:12:58,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:12:58,761 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:58,807 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-21 16:12:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:12:58,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 47 [2022-11-21 16:12:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:58,809 INFO L225 Difference]: With dead ends: 76 [2022-11-21 16:12:58,809 INFO L226 Difference]: Without dead ends: 76 [2022-11-21 16:12:58,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:12:58,810 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 90 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:58,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 93 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:12:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-21 16:12:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-21 16:12:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.173913043478261) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-21 16:12:58,813 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2022-11-21 16:12:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:58,813 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-21 16:12:58,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:12:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-21 16:12:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 16:12:58,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:58,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:58,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:59,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:59,021 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:12:59,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:59,021 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2022-11-21 16:12:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:59,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016307116] [2022-11-21 16:12:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:13:01,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:01,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016307116] [2022-11-21 16:13:01,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016307116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:13:01,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130333907] [2022-11-21 16:13:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:01,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:13:01,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:13:01,303 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:13:01,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 16:13:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:01,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-21 16:13:01,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:13:01,566 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:01,754 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:13:01,754 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:01,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:13:01,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-11-21 16:13:02,486 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:13:02,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2022-11-21 16:13:02,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 23 [2022-11-21 16:13:02,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:13:02,500 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 38 [2022-11-21 16:13:02,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:13:02,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:13:02,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-21 16:13:02,783 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 32 [2022-11-21 16:13:02,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:13:02,792 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 34 [2022-11-21 16:13:03,096 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 19 [2022-11-21 16:13:03,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 [2022-11-21 16:13:03,214 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:13:03,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:13:04,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:04,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 46 treesize of output 47 [2022-11-21 16:13:04,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:04,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 98 treesize of output 101 [2022-11-21 16:13:04,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 23 [2022-11-21 16:13:04,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:04,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 46 treesize of output 47 [2022-11-21 16:13:04,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:04,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 98 treesize of output 101 [2022-11-21 16:13:04,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 23 [2022-11-21 16:13:04,750 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-21 16:13:04,835 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0))))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse0) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse2 .cse1))) is different from false [2022-11-21 16:13:04,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) (select (store (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-21 16:13:04,985 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1308) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1306) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0)))) is different from false [2022-11-21 16:13:05,023 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) |c_ULTIMATE.start_sll_create_#res#1.base|))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1) .cse0)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-21 16:13:05,059 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-21 16:13:05,151 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|) (forall ((v_ArrVal_1313 Int) (v_ArrVal_1308 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1313) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1310 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1306) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_25| v_ArrVal_1310) .cse1))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_25|)))))) is different from false [2022-11-21 16:13:05,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:05,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 25 treesize of output 26 [2022-11-21 16:13:05,173 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 38 [2022-11-21 16:13:05,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:13:05,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 13 [2022-11-21 16:13:05,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:13:05,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2022-11-21 16:13:05,199 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 16:13:05,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-11-21 16:13:05,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:13:05,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:13:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-21 16:13:05,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130333907] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:13:05,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:13:05,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 73 [2022-11-21 16:13:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395412717] [2022-11-21 16:13:05,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:13:05,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-21 16:13:05,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:05,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-21 16:13:05,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4027, Unknown=51, NotChecked=938, Total=5256 [2022-11-21 16:13:05,562 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:13:10,500 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-11-21 16:13:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-21 16:13:10,501 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 0 states have call successors, (0), 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 48 [2022-11-21 16:13:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:13:10,502 INFO L225 Difference]: With dead ends: 97 [2022-11-21 16:13:10,502 INFO L226 Difference]: Without dead ends: 97 [2022-11-21 16:13:10,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1005, Invalid=8474, Unknown=55, NotChecked=1386, Total=10920 [2022-11-21 16:13:10,506 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 715 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 15 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 552 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:13:10,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 771 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1654 Invalid, 16 Unknown, 552 Unchecked, 1.6s Time] [2022-11-21 16:13:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-21 16:13:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-11-21 16:13:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 75 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-11-21 16:13:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-21 16:13:10,510 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2022-11-21 16:13:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:13:10,511 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-21 16:13:10,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 73 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-21 16:13:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-21 16:13:10,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:13:10,512 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:13:10,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-21 16:13:10,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-21 16:13:10,728 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:13:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:13:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2022-11-21 16:13:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:13:10,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019963743] [2022-11-21 16:13:10,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:10,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:13:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:13:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:11,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019963743] [2022-11-21 16:13:11,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019963743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:13:11,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448740582] [2022-11-21 16:13:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:11,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:13:11,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:13:11,431 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:13:11,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 16:13:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:11,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-21 16:13:11,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:13:12,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-11-21 16:13:12,459 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:13:12,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:13:12,675 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 32 [2022-11-21 16:13:12,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:13:12,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:13:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 16:13:12,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448740582] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:13:12,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:13:12,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 12] total 34 [2022-11-21 16:13:12,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583001370] [2022-11-21 16:13:12,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:13:12,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-21 16:13:12,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:12,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 16:13:12,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-11-21 16:13:12,832 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:13:14,243 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-11-21 16:13:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 16:13:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-21 16:13:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:13:14,252 INFO L225 Difference]: With dead ends: 99 [2022-11-21 16:13:14,252 INFO L226 Difference]: Without dead ends: 99 [2022-11-21 16:13:14,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2022-11-21 16:13:14,255 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 869 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:13:14,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 554 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:13:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-21 16:13:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-11-21 16:13:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-21 16:13:14,265 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2022-11-21 16:13:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:13:14,266 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-21 16:13:14,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.9411764705882355) internal successors, (134), 34 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-21 16:13:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 16:13:14,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:13:14,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:13:14,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 16:13:14,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:13:14,475 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:13:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:13:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2022-11-21 16:13:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:13:14,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311130174] [2022-11-21 16:13:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:13:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 16:13:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:14,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311130174] [2022-11-21 16:13:14,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311130174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:13:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151353011] [2022-11-21 16:13:14,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:13:14,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:13:14,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:13:14,693 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:13:14,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 16:13:14,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:13:14,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:13:14,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:13:14,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:13:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:13:15,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:13:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:13:15,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151353011] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:13:15,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:13:15,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-21 16:13:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454722618] [2022-11-21 16:13:15,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:13:15,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:13:15,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:15,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:13:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:13:15,143 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:13:15,222 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-11-21 16:13:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:13:15,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 58 [2022-11-21 16:13:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:13:15,223 INFO L225 Difference]: With dead ends: 71 [2022-11-21 16:13:15,224 INFO L226 Difference]: Without dead ends: 71 [2022-11-21 16:13:15,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:13:15,225 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 99 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:13:15,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 138 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:13:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-21 16:13:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-21 16:13:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-21 16:13:15,228 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2022-11-21 16:13:15,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:13:15,229 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-21 16:13:15,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-21 16:13:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:13:15,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:13:15,230 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:13:15,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 16:13:15,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:13:15,437 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:13:15,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:13:15,438 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2022-11-21 16:13:15,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:13:15,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588318894] [2022-11-21 16:13:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:15,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:13:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-21 16:13:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:15,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588318894] [2022-11-21 16:13:15,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588318894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:13:15,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:13:15,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:13:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721691195] [2022-11-21 16:13:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:13:15,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:13:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:15,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:13:15,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:13:15,626 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:13:15,874 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-11-21 16:13:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 16:13:15,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 59 [2022-11-21 16:13:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:13:15,875 INFO L225 Difference]: With dead ends: 82 [2022-11-21 16:13:15,875 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 16:13:15,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:13:15,876 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 226 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:13:15,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 89 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:13:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 16:13:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-11-21 16:13:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-21 16:13:15,879 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2022-11-21 16:13:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:13:15,879 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-21 16:13:15,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-21 16:13:15,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 16:13:15,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:13:15,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:13:15,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 16:13:15,880 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:13:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:13:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2022-11-21 16:13:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:13:15,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111796754] [2022-11-21 16:13:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:13:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:13:16,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111796754] [2022-11-21 16:13:16,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111796754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:13:16,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:13:16,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:13:16,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779559299] [2022-11-21 16:13:16,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:13:16,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:13:16,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:16,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:13:16,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:13:16,205 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:13:16,468 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-21 16:13:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:13:16,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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 59 [2022-11-21 16:13:16,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:13:16,477 INFO L225 Difference]: With dead ends: 80 [2022-11-21 16:13:16,478 INFO L226 Difference]: Without dead ends: 80 [2022-11-21 16:13:16,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:13:16,478 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 290 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:13:16,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 52 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:13:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-21 16:13:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-21 16:13:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-21 16:13:16,483 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2022-11-21 16:13:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:13:16,484 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-21 16:13:16,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-21 16:13:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-21 16:13:16,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:13:16,485 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:13:16,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 16:13:16,485 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:13:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:13:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2022-11-21 16:13:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:13:16,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269848499] [2022-11-21 16:13:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:13:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:13:16,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:16,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269848499] [2022-11-21 16:13:16,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269848499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:13:16,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:13:16,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:13:16,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848321191] [2022-11-21 16:13:16,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:13:16,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:13:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:16,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:13:16,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:13:16,651 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:13:16,819 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-11-21 16:13:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:13:16,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 60 [2022-11-21 16:13:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:13:16,820 INFO L225 Difference]: With dead ends: 77 [2022-11-21 16:13:16,820 INFO L226 Difference]: Without dead ends: 77 [2022-11-21 16:13:16,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:13:16,821 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 272 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:13:16,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 81 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:13:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-21 16:13:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-11-21 16:13:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-11-21 16:13:16,823 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2022-11-21 16:13:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:13:16,824 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-11-21 16:13:16,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-11-21 16:13:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-21 16:13:16,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:13:16,825 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:13:16,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 16:13:16,825 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:13:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:13:16,825 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2022-11-21 16:13:16,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:13:16,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976865593] [2022-11-21 16:13:16,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:16,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:13:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 16:13:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:17,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976865593] [2022-11-21 16:13:17,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976865593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:13:17,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:13:17,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:13:17,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699681007] [2022-11-21 16:13:17,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:13:17,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:13:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:17,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:13:17,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:13:17,007 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:13:17,234 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-11-21 16:13:17,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:13:17,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 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 62 [2022-11-21 16:13:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:13:17,236 INFO L225 Difference]: With dead ends: 75 [2022-11-21 16:13:17,236 INFO L226 Difference]: Without dead ends: 75 [2022-11-21 16:13:17,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:13:17,236 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 255 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:13:17,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 65 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:13:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-21 16:13:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-21 16:13:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-21 16:13:17,239 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2022-11-21 16:13:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:13:17,239 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-21 16:13:17,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-21 16:13:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 16:13:17,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:13:17,240 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:13:17,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 16:13:17,240 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:13:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:13:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2022-11-21 16:13:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:13:17,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597271496] [2022-11-21 16:13:17,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:13:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 16:13:18,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:18,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597271496] [2022-11-21 16:13:18,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597271496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:13:18,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179303252] [2022-11-21 16:13:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:18,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:13:18,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:13:18,785 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:13:18,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 16:13:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:19,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-21 16:13:19,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:13:19,064 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:19,123 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:13:19,124 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:19,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-21 16:13:19,409 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:13:19,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-21 16:13:19,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:13:19,510 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 23 [2022-11-21 16:13:19,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:19,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 20 [2022-11-21 16:13:19,833 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:13:19,833 INFO L350 Elim1Store]: Elim1 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 18 [2022-11-21 16:13:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 16:13:19,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:13:22,526 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-21 16:13:22,836 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|))) is different from false [2022-11-21 16:13:23,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_34| Int) (v_ArrVal_1845 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_1843) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_34| v_ArrVal_1845) 4)) 1))) is different from false [2022-11-21 16:13:23,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:23,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 28 treesize of output 29 [2022-11-21 16:13:23,326 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 44 [2022-11-21 16:13:23,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:23,343 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 44 [2022-11-21 16:13:23,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 30 [2022-11-21 16:13:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 4 not checked. [2022-11-21 16:13:23,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179303252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:13:23,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:13:23,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 45 [2022-11-21 16:13:23,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650205093] [2022-11-21 16:13:23,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:13:23,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-21 16:13:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:23,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-21 16:13:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1605, Unknown=60, NotChecked=252, Total=2070 [2022-11-21 16:13:23,973 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:13:26,424 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-11-21 16:13:26,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 16:13:26,424 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 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 65 [2022-11-21 16:13:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:13:26,425 INFO L225 Difference]: With dead ends: 89 [2022-11-21 16:13:26,425 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 16:13:26,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=671, Invalid=3836, Unknown=61, NotChecked=402, Total=4970 [2022-11-21 16:13:26,428 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 476 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:13:26,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 407 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 965 Invalid, 0 Unknown, 210 Unchecked, 0.9s Time] [2022-11-21 16:13:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 16:13:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-11-21 16:13:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-11-21 16:13:26,433 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2022-11-21 16:13:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:13:26,433 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-11-21 16:13:26,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 46 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:13:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-11-21 16:13:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-21 16:13:26,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:13:26,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:13:26,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-21 16:13:26,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-21 16:13:26,641 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:13:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:13:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2022-11-21 16:13:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:13:26,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84997700] [2022-11-21 16:13:26,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:13:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:13:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84997700] [2022-11-21 16:13:28,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84997700] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:13:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652790184] [2022-11-21 16:13:28,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:28,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:13:28,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:13:28,727 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:13:28,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-21 16:13:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:28,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-21 16:13:28,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:13:28,988 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:28,999 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:29,233 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:13:29,234 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:29,252 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:13:29,252 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:29,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-21 16:13:29,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:13:30,057 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:13:30,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-11-21 16:13:30,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:13:30,070 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2022-11-21 16:13:30,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:13:30,235 INFO L350 Elim1Store]: Elim1 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-11-21 16:13:30,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:13:30,243 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2022-11-21 16:13:30,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:30,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 18 [2022-11-21 16:13:30,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:30,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 21 [2022-11-21 16:13:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:13:31,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:13:37,353 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (< (select .cse0 .cse1) 0) (<= 0 (+ (select .cse0 4) 4))))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_37| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_37|) (forall ((v_ArrVal_1964 Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1964))) (or (forall ((v_ArrVal_1962 Int)) (<= (+ (select .cse2 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_37| v_ArrVal_1962) 4)))) (< (select .cse2 .cse1) 0)))))))) is different from false [2022-11-21 16:13:48,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:48,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 131 treesize of output 102 [2022-11-21 16:13:48,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:48,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 91 treesize of output 92 [2022-11-21 16:13:48,687 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 116 [2022-11-21 16:13:48,698 INFO L350 Elim1Store]: Elim1 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 214 treesize of output 202 [2022-11-21 16:13:48,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 231 treesize of output 227 [2022-11-21 16:13:48,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:48,731 INFO L350 Elim1Store]: Elim1 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 288 treesize of output 287 [2022-11-21 16:13:48,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:48,759 INFO L350 Elim1Store]: Elim1 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 334 treesize of output 332 [2022-11-21 16:13:48,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:48,801 INFO L350 Elim1Store]: Elim1 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 424 treesize of output 410 [2022-11-21 16:13:48,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:13:48,829 INFO L350 Elim1Store]: Elim1 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 423 treesize of output 426 [2022-11-21 16:13:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:13:56,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652790184] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:13:56,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:13:56,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 27] total 71 [2022-11-21 16:13:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254073067] [2022-11-21 16:13:56,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:13:56,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-21 16:13:56,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:56,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-21 16:13:56,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4648, Unknown=35, NotChecked=138, Total=5112 [2022-11-21 16:13:56,365 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:14:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:04,731 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-21 16:14:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-21 16:14:04,731 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 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 65 [2022-11-21 16:14:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:04,732 INFO L225 Difference]: With dead ends: 90 [2022-11-21 16:14:04,732 INFO L226 Difference]: Without dead ends: 90 [2022-11-21 16:14:04,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=1335, Invalid=8534, Unknown=35, NotChecked=196, Total=10100 [2022-11-21 16:14:04,735 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1050 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:04,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 553 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1311 Invalid, 0 Unknown, 74 Unchecked, 1.7s Time] [2022-11-21 16:14:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-21 16:14:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2022-11-21 16:14:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:14:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-21 16:14:04,739 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2022-11-21 16:14:04,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:04,740 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-21 16:14:04,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.3661971830985915) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:14:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-21 16:14:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-21 16:14:04,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:04,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:04,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-21 16:14:04,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-21 16:14:04,949 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:14:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2022-11-21 16:14:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:04,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961064012] [2022-11-21 16:14:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:14:06,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:06,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961064012] [2022-11-21 16:14:06,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961064012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:14:06,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745379471] [2022-11-21 16:14:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:06,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:14:06,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:14:06,811 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:14:06,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-21 16:14:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:07,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-21 16:14:07,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:14:07,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:14:08,810 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:14:08,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2022-11-21 16:14:08,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:14:08,822 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-11-21 16:14:09,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:14:09,285 INFO L350 Elim1Store]: Elim1 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 72 treesize of output 59 [2022-11-21 16:14:10,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:14:10,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 56 [2022-11-21 16:14:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 16:14:11,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:14:14,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:14:14,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 24 treesize of output 25 [2022-11-21 16:14:14,049 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 37 [2022-11-21 16:14:14,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:14:14,068 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 50 [2022-11-21 16:14:14,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 46 [2022-11-21 16:14:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 16:14:15,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745379471] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:14:15,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:14:15,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-11-21 16:14:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316464658] [2022-11-21 16:14:15,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:14:15,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-21 16:14:15,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-21 16:14:15,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4820, Unknown=10, NotChecked=0, Total=5112 [2022-11-21 16:14:15,368 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:14:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:27,853 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-11-21 16:14:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-21 16:14:27,854 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 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 66 [2022-11-21 16:14:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:27,855 INFO L225 Difference]: With dead ends: 141 [2022-11-21 16:14:27,855 INFO L226 Difference]: Without dead ends: 141 [2022-11-21 16:14:27,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2367 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=1422, Invalid=12139, Unknown=11, NotChecked=0, Total=13572 [2022-11-21 16:14:27,857 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1134 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 77 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:27,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1003 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1760 Invalid, 3 Unknown, 0 Unchecked, 2.6s Time] [2022-11-21 16:14:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-21 16:14:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 80. [2022-11-21 16:14:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:14:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-21 16:14:27,861 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2022-11-21 16:14:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:27,861 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-21 16:14:27,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.486111111111111) internal successors, (179), 72 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:14:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-21 16:14:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 16:14:27,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:27,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:27,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-21 16:14:28,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:14:28,070 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:14:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2022-11-21 16:14:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:28,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996675724] [2022-11-21 16:14:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:14:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:29,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996675724] [2022-11-21 16:14:29,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996675724] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:14:29,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735472492] [2022-11-21 16:14:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:29,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:14:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:14:29,587 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:14:29,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-21 16:14:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:29,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-21 16:14:29,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:14:29,873 INFO L350 Elim1Store]: Elim1 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-11-21 16:14:29,964 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:14:29,965 INFO L350 Elim1Store]: Elim1 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-11-21 16:14:30,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:14:30,227 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:14:30,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 16:14:30,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:14:30,321 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2022-11-21 16:14:30,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:14:30,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 21 [2022-11-21 16:14:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:14:30,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:14:31,158 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-21 16:14:31,175 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-21 16:14:31,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-21 16:14:31,207 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-21 16:14:31,219 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|) (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-21 16:14:31,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_43| Int) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2191 Int)) (or (< (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2189) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_43| v_ArrVal_2191) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_43|))) is different from false [2022-11-21 16:14:31,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:14:31,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 treesize of output 24 [2022-11-21 16:14:31,402 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 34 [2022-11-21 16:14:31,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:14:31,415 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 34 [2022-11-21 16:14:31,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 20 [2022-11-21 16:14:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2022-11-21 16:14:31,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735472492] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:14:31,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:14:31,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 46 [2022-11-21 16:14:31,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835721471] [2022-11-21 16:14:31,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:14:31,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-21 16:14:31,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:14:31,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-21 16:14:31,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1496, Unknown=19, NotChecked=498, Total=2162 [2022-11-21 16:14:31,888 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:14:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:14:35,707 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2022-11-21 16:14:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 16:14:35,707 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 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 68 [2022-11-21 16:14:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:14:35,708 INFO L225 Difference]: With dead ends: 88 [2022-11-21 16:14:35,708 INFO L226 Difference]: Without dead ends: 88 [2022-11-21 16:14:35,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=630, Invalid=3665, Unknown=19, NotChecked=798, Total=5112 [2022-11-21 16:14:35,710 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 366 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 25 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:14:35,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 586 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 828 Invalid, 3 Unknown, 460 Unchecked, 0.8s Time] [2022-11-21 16:14:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-21 16:14:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2022-11-21 16:14:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.105263157894737) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:14:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-11-21 16:14:35,713 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2022-11-21 16:14:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:14:35,714 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-11-21 16:14:35,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.0) internal successors, (138), 47 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:14:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-11-21 16:14:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 16:14:35,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:14:35,715 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:14:35,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-21 16:14:35,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:14:35,924 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-21 16:14:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:14:35,924 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2022-11-21 16:14:35,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:14:35,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569112648] [2022-11-21 16:14:35,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:14:35,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:14:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:14:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 16:14:39,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:14:39,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569112648] [2022-11-21 16:14:39,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569112648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:14:39,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862390156] [2022-11-21 16:14:39,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:14:39,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:14:39,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:14:39,398 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:14:39,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_870c60c1-f826-4af8-89f0-bd7186f7b959/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-21 16:14:39,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:14:39,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:14:39,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-21 16:14:39,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:14:39,705 INFO L350 Elim1Store]: Elim1 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-11-21 16:14:39,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-21 16:14:39,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-21 16:14:39,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:14:39,827 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-21 16:14:39,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:14:39,838 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-21 16:14:39,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:14:39,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-21 16:14:39,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:14:39,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-21 16:14:40,039 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:14:40,040 INFO L350 Elim1Store]: Elim1 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-11-21 16:14:40,077 INFO L350 Elim1Store]: Elim1 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-11-21 16:14:40,085 INFO L350 Elim1Store]: Elim1 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-11-21 16:14:40,105 INFO L350 Elim1Store]: Elim1 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-11-21 16:14:40,114 INFO L350 Elim1Store]: Elim1 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-11-21 16:14:40,176 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-21 16:14:40,182 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 26 [2022-11-21 16:14:41,003 INFO L321 Elim1Store]: treesize reduction 98, result has 41.0 percent of original size [2022-11-21 16:14:41,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 118 [2022-11-21 16:14:41,108 INFO L321 Elim1Store]: treesize reduction 52, result has 52.7 percent of original size [2022-11-21 16:14:41,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 123 [2022-11-21 16:14:42,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:14:42,145 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-11-21 16:14:42,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 121 [2022-11-21 16:14:42,208 INFO L321 Elim1Store]: treesize reduction 40, result has 54.0 percent of original size [2022-11-21 16:14:42,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 129 treesize of output 158 [2022-11-21 16:14:42,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2022-11-21 16:14:42,416 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:14:42,416 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 11 [2022-11-21 16:14:42,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2022-11-21 16:14:44,881 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-21 16:14:44,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2022-11-21 16:14:44,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:14:44,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 15 [2022-11-21 16:14:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 16:14:44,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:14:56,662 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-21 16:14:56,663 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 193 [2022-11-21 16:14:56,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 286 treesize of output 274 [2022-11-21 16:14:57,048 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-21 16:14:57,048 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 189 [2022-11-21 16:14:57,223 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-21 16:14:57,223 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 254 treesize of output 217 [2022-11-21 16:15:01,316 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse9 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse0 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse48 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse86 (select v_arrayElimArr_13 4)) (.cse87 (select v_arrayElimArr_12 4))) (select (store (let ((.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse85 .cse86 (store (select .cse85 .cse86) .cse87 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse88 .cse86 (store (select .cse88 .cse86) .cse87 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (.cse32 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (select (store (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse84 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (.cse4 (not .cse9))) (and (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse2 (select v_arrayElimArr_12 4))) (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) .cse4) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (or (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))) (= (select (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11)) (.cse8 (select v_arrayElimArr_11 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse6 0 v_ArrVal_2326)) (select .cse6 4)))) 4) 0))) .cse9) (or .cse4 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (or (= (select (let ((.cse10 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse11 0 v_ArrVal_2326)) (select .cse11 4)))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0)))))) (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int) (v_arrayElimCell_136 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (or (= (select (let ((.cse13 (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base|) v_arrayElimCell_136 v_ArrVal_2322)))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse13 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse14 0 v_ArrVal_2326)) (select .cse14 4)))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))) (= (select (let ((.cse16 (let ((.cse18 (select v_arrayElimArr_11 4))) (store .cse15 .cse18 (store (select .cse15 .cse18) v_arrayElimCell_136 v_ArrVal_2322))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse17 0 v_ArrVal_2326)) (select .cse17 4)))) 4) 0))))) (or .cse4 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_arrayElimCell_135 Int) (v_ArrVal_2326 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (or (= (select (let ((.cse19 (store .cse21 v_arrayElimCell_135 (store (select .cse21 v_arrayElimCell_135) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse19 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse20 0 v_ArrVal_2326)) (select .cse20 4)))) 4) 0) (= (select (let ((.cse22 (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse22 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse23 0 v_ArrVal_2326)) (select .cse23 4)))) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse24 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_11))) (store .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (select (store .cse24 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store .cse25 0 v_ArrVal_2326)) (select .cse25 4)))) 4) 0)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 .cse0))))))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) .cse4) (or .cse4 (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (let ((.cse30 (select v_arrayElimArr_12 4))) (select (store (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse30 v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse30 v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) .cse32 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse34 (select v_arrayElimArr_12 4))) (or (= (select (select (store (store .cse33 v_arrayElimCell_138 (store (select .cse33 v_arrayElimCell_138) .cse34 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse35 v_arrayElimCell_138 (store (select .cse35 v_arrayElimCell_138) .cse34 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse34 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse35 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse34 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse40 (select v_arrayElimArr_13 4))) (let ((.cse41 (select .cse36 .cse40)) (.cse42 (select .cse38 .cse40)) (.cse37 (select .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse39 (select .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse43 (select v_arrayElimArr_12 4))) (or (= (select (select (store (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse37 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse36 .cse40 (store .cse41 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 .cse40 (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse36 .cse40 (store .cse41 .cse43 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 .cse40 (store .cse42 .cse43 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse37 .cse43 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse38 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse39 .cse43 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse46 (select v_arrayElimArr_12 4))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (let ((.cse45 (select v_arrayElimArr_13 4))) (select (store (store .cse44 .cse45 (store (select .cse44 .cse45) .cse46 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse47 .cse45 (store (select .cse47 .cse45) .cse46 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select (store (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse46 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse46 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))) .cse9) (or .cse48 .cse9) (or .cse4 .cse48) (or .cse9 (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse50 (select v_arrayElimArr_13 4))) (let ((.cse51 (select .cse49 .cse50)) (.cse53 (select .cse52 .cse50)) (.cse54 (select v_arrayElimArr_12 4))) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (select (store (store .cse49 .cse50 (store .cse51 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse52 .cse50 (store .cse53 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse49 .cse50 (store .cse51 .cse54 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse52 .cse50 (store .cse53 .cse54 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse54 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse54 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))) (or (and (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (= (select (select (store (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse60 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse58 (select v_arrayElimArr_13 4))) (let ((.cse59 (select .cse57 .cse58)) (.cse61 (select .cse60 .cse58))) (or (= (select (select (store (store .cse57 .cse58 (store .cse59 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse60 .cse58 (store .cse61 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse57 .cse58 (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse60 .cse58 (store .cse61 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse66 (select .cse62 v_arrayElimCell_138)) (.cse67 (select .cse64 v_arrayElimCell_138)) (.cse63 (select .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse65 (select .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse63 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse65 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse62 v_arrayElimCell_138 (store .cse66 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 v_arrayElimCell_138 (store .cse67 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse62 v_arrayElimCell_138 (store .cse66 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 v_arrayElimCell_138 (store .cse67 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse63 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse64 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse65 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) .cse32 (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse69 (select .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse71 (select .cse70 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse70 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse71 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse68 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse69 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse70 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse71 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse72 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse73 (select .cse72 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse75 (select .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse72 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse73 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse75 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse72 v_arrayElimCell_138 (store (select .cse72 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse74 v_arrayElimCell_138 (store (select .cse74 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= (select (select (store (store .cse72 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse73 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse74 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse75 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0))))))) (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse76 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12)) (.cse77 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (or (= (select (select (store (store .cse76 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse76 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse77 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (let ((.cse78 (select v_arrayElimArr_13 4))) (select (store (store .cse76 .cse78 (store (select .cse76 .cse78) v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse77 .cse78 (store (select .cse77 .cse78) v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse81 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse79 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse82 (select .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse80 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse82 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 .cse0) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store (store .cse79 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse80 v_arrayElimCell_137 v_ArrVal_2324)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2325) (select (select (store .cse81 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse82 v_arrayElimCell_137 v_ArrVal_2322)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0)))))))) .cse4)))) (not (<= 0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) is different from true [2022-11-21 16:15:05,935 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (let ((.cse0 (select v_arrayElimArr_13 4))) (or (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13)) (.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (let ((.cse2 (select .cse1 .cse0)) (.cse4 (select .cse3 .cse0))) (or (= 0 (select (select (store (store .cse1 .cse0 (store .cse2 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse3 .cse0 (store .cse4 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4)) (= (select (select (store (store .cse1 .cse0 (store .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse3 .cse0 (store .cse4 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0)))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (= (select (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (store .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse6 (select .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse6 0 v_ArrVal_2326)) (select .cse6 4)))) 4) 0)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 4))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse9 (select v_arrayElimArr_12 4))) (or (= (select (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (store .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse9 v_ArrVal_2324))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (store .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse9 v_ArrVal_2322))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (select (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (store .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13)) (.cse13 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse16 (select .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse13 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse14 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse13 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse14 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse15 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse16 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse13 v_arrayElimCell_138 (store (select .cse13 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse15 v_arrayElimCell_138 (store (select .cse15 v_arrayElimCell_138) v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse19 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13)) (.cse17 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (let ((.cse21 (select .cse17 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse22 (select .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse18 (select .cse17 v_arrayElimCell_138)) (.cse20 (select .cse19 v_arrayElimCell_138))) (or (= (select (select (store (store .cse17 v_arrayElimCell_138 (store .cse18 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse19 v_arrayElimCell_138 (store .cse20 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse17 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse22 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse17 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse21 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse19 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse22 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse17 v_arrayElimCell_138 (store .cse18 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse19 v_arrayElimCell_138 (store .cse20 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse24 (select v_arrayElimArr_13 4)) (.cse23 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12)) (.cse25 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (or (= 0 (select (select (store (store .cse23 .cse24 (store (select .cse23 .cse24) v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse25 .cse24 (store (select .cse25 .cse24) v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4)) (not (= .cse24 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store (store .cse23 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse23 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse25 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0)))) (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store (let ((.cse26 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (store .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (let ((.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (store .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (or (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (store .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse28 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (let ((.cse29 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (store .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse29 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse31 (select v_arrayElimArr_13 4)) (.cse32 (select v_arrayElimArr_12 4))) (or (= (select (select (store (let ((.cse30 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (store .cse30 .cse31 (store (select .cse30 .cse31) .cse32 v_ArrVal_2324))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (let ((.cse33 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (store .cse33 .cse31 (store (select .cse33 .cse31) .cse32 v_ArrVal_2322))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (not (= .cse31 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2326 Int)) (or (= (select (let ((.cse34 (let ((.cse36 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (store .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322))))) (let ((.cse35 (select .cse34 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse34 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse35 0 v_ArrVal_2326)) (select .cse35 4)))) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 4))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_2322 Int) (v_arrayElimCell_135 Int) (v_ArrVal_2326 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_11))) (or (= (select (let ((.cse37 (store .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse38 (select .cse37 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse37 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse38 0 v_ArrVal_2326)) (select .cse38 4)))) 4) 0) (= (select (let ((.cse40 (store .cse39 v_arrayElimCell_135 (store (select .cse39 v_arrayElimCell_135) |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)))) (let ((.cse41 (select .cse40 |v_ULTIMATE.start_node_create_~temp~0#1.base_37|))) (select (store .cse40 |v_ULTIMATE.start_node_create_~temp~0#1.base_37| (store .cse41 0 v_ArrVal_2326)) (select .cse41 4)))) 4) 0)))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_11 4))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse43 (select v_arrayElimArr_12 4))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_138 Int)) (let ((.cse42 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12)) (.cse44 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (or (= (select (select (store (store .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse43 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse43 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse42 v_arrayElimCell_138 (store (select .cse42 v_arrayElimCell_138) .cse43 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse44 v_arrayElimCell_138 (store (select .cse44 v_arrayElimCell_138) .cse43 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0)))))) (not (= .cse43 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse45 (select v_arrayElimArr_12 4))) (or (not (= .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (= (select (select (store (let ((.cse46 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (store .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse46 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse45 v_ArrVal_2324))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (let ((.cse47 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13))) (store .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse47 |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse45 v_ArrVal_2322))) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int) (v_arrayElimCell_137 Int)) (let ((.cse50 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13)) (.cse48 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse51 (select .cse50 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select (store (store .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse49 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse50 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse51 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse49 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse50 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse51 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_37| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_137 Int)) (or (forall ((v_ArrVal_2325 (Array Int Int)) (v_ArrVal_2322 Int) (v_ArrVal_2324 Int)) (let ((.cse54 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_13)) (.cse52 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_arrayElimArr_12))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse55 (select .cse54 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (= (select (select (store (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse53 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse54 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse55 |c_ULTIMATE.start_sll_create_~head~0#1.offset| v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0) (= (select (select (store (store .cse52 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse53 v_arrayElimCell_137 v_ArrVal_2324)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37| v_ArrVal_2325) (select (select (store .cse54 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse55 v_arrayElimCell_137 v_ArrVal_2322)) |v_ULTIMATE.start_node_create_~temp~0#1.base_37|) 4)) 4) 0))))) (not (= (select v_arrayElimArr_13 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (not (= (select v_arrayElimArr_12 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))))) is different from true [2022-11-21 16:16:07,179 WARN L233 SmtUtils]: Spent 8.69s on a formula simplification. DAG size of input: 249 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:16:29,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:29,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:29,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 191 [2022-11-21 16:16:29,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:16:29,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:29,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 119 [2022-11-21 16:16:29,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:29,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 11133 treesize of output 10591 [2022-11-21 16:16:29,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10374 treesize of output 10068 [2022-11-21 16:16:29,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2022-11-21 16:16:29,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9875 treesize of output 8475 [2022-11-21 16:16:30,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8071 treesize of output 7895 [2022-11-21 16:16:30,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8021 treesize of output 7951 [2022-11-21 16:16:30,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 436 treesize of output 432 [2022-11-21 16:16:32,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 314 treesize of output 306