./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/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_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 10:30:00,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:30:00,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:30:00,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:30:00,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:30:00,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:30:00,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:30:00,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:30:00,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:30:00,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:30:00,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:30:00,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:30:00,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:30:00,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:30:00,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:30:00,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:30:00,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:30:00,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:30:00,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:30:00,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:30:00,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:30:00,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:30:00,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:30:00,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:30:00,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:30:00,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:30:00,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:30:00,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:30:00,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:30:00,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:30:00,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:30:00,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:30:00,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:30:00,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:30:00,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:30:00,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:30:00,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:30:00,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:30:00,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:30:00,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:30:00,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:30:00,607 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:30:00,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:30:00,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:30:00,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:30:00,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:30:00,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:30:00,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:30:00,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:30:00,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:30:00,652 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:30:00,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:30:00,654 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:30:00,654 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:30:00,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:30:00,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:30:00,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:30:00,655 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:30:00,655 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:30:00,655 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:30:00,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:30:00,655 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:30:00,656 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:30:00,656 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:30:00,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:30:00,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:30:00,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:30:00,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:00,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:30:00,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:30:00,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:30:00,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:30:00,658 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_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/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_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN 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-20 10:30:00,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:30:00,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:30:00,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:30:00,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:30:00,979 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:30:00,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-20 10:30:04,049 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:30:04,458 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:30:04,459 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-20 10:30:04,480 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/data/b7b188707/d6bad5a74cd34a779b01ec315bdab031/FLAG0a0a61a65 [2022-11-20 10:30:04,501 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/data/b7b188707/d6bad5a74cd34a779b01ec315bdab031 [2022-11-20 10:30:04,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:30:04,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:30:04,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:04,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:30:04,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:30:04,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:04" (1/1) ... [2022-11-20 10:30:04,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3535722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:04, skipping insertion in model container [2022-11-20 10:30:04,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:04" (1/1) ... [2022-11-20 10:30:04,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:30:04,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:30:04,881 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_372d07f5-eb9a-45ec-9e23-aff2631eeada/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-20 10:30:04,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:04,903 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:30:04,981 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_372d07f5-eb9a-45ec-9e23-aff2631eeada/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-20 10:30:04,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:30:05,020 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:30:05,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05 WrapperNode [2022-11-20 10:30:05,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:30:05,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:05,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:30:05,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:30:05,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,096 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-11-20 10:30:05,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:30:05,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:30:05,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:30:05,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:30:05,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,143 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:30:05,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:30:05,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:30:05,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:30:05,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (1/1) ... [2022-11-20 10:30:05,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:30:05,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:05,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:30:05,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:30:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:30:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:30:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:30:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:30:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:30:05,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:30:05,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:30:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:30:05,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:30:05,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:30:05,437 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:30:05,440 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:30:05,762 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:30:05,769 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:30:05,775 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 10:30:05,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:05 BoogieIcfgContainer [2022-11-20 10:30:05,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:30:05,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:30:05,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:30:05,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:30:05,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:30:04" (1/3) ... [2022-11-20 10:30:05,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b12d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:05, skipping insertion in model container [2022-11-20 10:30:05,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:05" (2/3) ... [2022-11-20 10:30:05,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b12d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:05, skipping insertion in model container [2022-11-20 10:30:05,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:05" (3/3) ... [2022-11-20 10:30:05,791 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-20 10:30:05,812 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:30:05,813 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-20 10:30:05,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:30:05,894 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;@6dee97de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:30:05,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-20 10:30:05,900 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-20 10:30:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 10:30:05,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:05,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 10:30:05,909 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-20 10:30:05,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:05,918 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-11-20 10:30:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:05,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215745138] [2022-11-20 10:30:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,253 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-20 10:30:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:06,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215745138] [2022-11-20 10:30:06,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215745138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:06,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:06,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:30:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672568284] [2022-11-20 10:30:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:06,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:30:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:06,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:06,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:06,299 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-20 10:30:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:06,413 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-20 10:30:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:06,416 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-20 10:30:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:06,426 INFO L225 Difference]: With dead ends: 109 [2022-11-20 10:30:06,426 INFO L226 Difference]: Without dead ends: 104 [2022-11-20 10:30:06,428 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-20 10:30:06,432 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-20 10:30:06,433 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-20 10:30:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-20 10:30:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-20 10:30:06,471 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-20 10:30:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-20 10:30:06,474 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2022-11-20 10:30:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:06,474 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-20 10:30:06,475 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-20 10:30:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-20 10:30:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 10:30:06,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:06,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 10:30:06,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:30:06,476 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-20 10:30:06,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-11-20 10:30:06,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:06,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066823650] [2022-11-20 10:30:06,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,659 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-20 10:30:06,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:06,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066823650] [2022-11-20 10:30:06,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066823650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:06,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:06,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:30:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932259483] [2022-11-20 10:30:06,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:06,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:30:06,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:06,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:06,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:06,663 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-20 10:30:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:06,751 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-20 10:30:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:06,754 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-20 10:30:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:06,755 INFO L225 Difference]: With dead ends: 102 [2022-11-20 10:30:06,755 INFO L226 Difference]: Without dead ends: 102 [2022-11-20 10:30:06,756 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-20 10:30:06,757 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 10:30:06,758 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-20 10:30:06,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-20 10:30:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-11-20 10:30:06,763 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-20 10:30:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-20 10:30:06,772 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2022-11-20 10:30:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:06,772 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-20 10:30:06,773 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-20 10:30:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-20 10:30:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 10:30:06,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:06,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:06,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:30:06,778 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-20 10:30:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2022-11-20 10:30:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:06,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656838764] [2022-11-20 10:30:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,827 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-20 10:30:06,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:06,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656838764] [2022-11-20 10:30:06,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656838764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:06,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:06,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:30:06,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243892464] [2022-11-20 10:30:06,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:06,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:30:06,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:06,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:30:06,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:30:06,830 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-20 10:30:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:06,842 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-11-20 10:30:06,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:30:06,843 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-20 10:30:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:06,844 INFO L225 Difference]: With dead ends: 68 [2022-11-20 10:30:06,844 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 10:30:06,844 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-20 10:30:06,846 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-20 10:30:06,846 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-20 10:30:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 10:30:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-11-20 10:30:06,851 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-20 10:30:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-20 10:30:06,852 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2022-11-20 10:30:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:06,853 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-20 10:30:06,853 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-20 10:30:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-20 10:30:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:30:06,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:06,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:06,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:30:06,854 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-20 10:30:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-11-20 10:30:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:06,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734017703] [2022-11-20 10:30:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:06,958 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-20 10:30:06,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:06,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734017703] [2022-11-20 10:30:06,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734017703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:06,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:06,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:30:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915038286] [2022-11-20 10:30:06,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:06,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:06,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:06,961 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-20 10:30:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:07,070 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-20 10:30:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:07,071 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-20 10:30:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:07,072 INFO L225 Difference]: With dead ends: 76 [2022-11-20 10:30:07,073 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 10:30:07,073 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-20 10:30:07,075 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-20 10:30:07,075 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-20 10:30:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 10:30:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-11-20 10:30:07,081 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-20 10:30:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-20 10:30:07,082 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2022-11-20 10:30:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:07,082 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-20 10:30:07,083 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-20 10:30:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-20 10:30:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:30:07,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:07,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:07,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:30:07,085 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-20 10:30:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-11-20 10:30:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:07,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595199624] [2022-11-20 10:30:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,296 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-20 10:30:07,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:07,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595199624] [2022-11-20 10:30:07,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595199624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:07,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:07,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:30:07,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127487384] [2022-11-20 10:30:07,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:07,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:07,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:07,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:07,302 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-20 10:30:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:07,414 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-20 10:30:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:07,414 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-20 10:30:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:07,417 INFO L225 Difference]: With dead ends: 61 [2022-11-20 10:30:07,418 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 10:30:07,419 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-20 10:30:07,420 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 10:30:07,424 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-20 10:30:07,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 10:30:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-20 10:30:07,435 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-20 10:30:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-20 10:30:07,436 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2022-11-20 10:30:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:07,437 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-20 10:30:07,437 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-20 10:30:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-20 10:30:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:30:07,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:07,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:07,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:30:07,440 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-20 10:30:07,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2022-11-20 10:30:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:07,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114209613] [2022-11-20 10:30:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,545 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-20 10:30:07,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:07,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114209613] [2022-11-20 10:30:07,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114209613] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:07,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533939613] [2022-11-20 10:30:07,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:07,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:07,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:07,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:07,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:30:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:07,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:30:07,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:07,776 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-20 10:30:07,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:07,831 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-20 10:30:07,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533939613] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:07,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:07,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-20 10:30:07,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993725555] [2022-11-20 10:30:07,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:07,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:07,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:07,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:07,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:30:07,834 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-20 10:30:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:07,850 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-20 10:30:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:30:07,851 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-20 10:30:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:07,852 INFO L225 Difference]: With dead ends: 65 [2022-11-20 10:30:07,852 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 10:30:07,852 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-20 10:30:07,853 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-20 10:30:07,854 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-20 10:30:07,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 10:30:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 10:30:07,858 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-20 10:30:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-20 10:30:07,859 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2022-11-20 10:30:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:07,860 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-20 10:30:07,860 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-20 10:30:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-20 10:30:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 10:30:07,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:07,861 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:07,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:08,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 10:30:08,068 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-20 10:30:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2022-11-20 10:30:08,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:08,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768899218] [2022-11-20 10:30:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,290 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-20 10:30:08,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:08,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768899218] [2022-11-20 10:30:08,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768899218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:08,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:08,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:30:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081273312] [2022-11-20 10:30:08,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:08,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:08,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:08,293 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-20 10:30:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:08,560 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-20 10:30:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:30:08,561 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-20 10:30:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:08,562 INFO L225 Difference]: With dead ends: 116 [2022-11-20 10:30:08,563 INFO L226 Difference]: Without dead ends: 116 [2022-11-20 10:30:08,563 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-20 10:30:08,564 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 380 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 10:30:08,565 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-20 10:30:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-20 10:30:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-11-20 10:30:08,581 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-20 10:30:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-20 10:30:08,582 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2022-11-20 10:30:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:08,582 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-20 10:30:08,582 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-20 10:30:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-20 10:30:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 10:30:08,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:08,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:08,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:30:08,584 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-20 10:30:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:08,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2022-11-20 10:30:08,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:08,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427844925] [2022-11-20 10:30:08,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:08,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,825 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-20 10:30:08,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:08,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427844925] [2022-11-20 10:30:08,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427844925] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:08,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084462009] [2022-11-20 10:30:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:08,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:08,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:08,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:08,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:30:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:08,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:30:08,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:08,998 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-20 10:30:08,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:30:08,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084462009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:08,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:30:08,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-20 10:30:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858226653] [2022-11-20 10:30:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:09,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:09,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:09,001 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-20 10:30:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:09,064 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-11-20 10:30:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:09,065 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-20 10:30:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:09,066 INFO L225 Difference]: With dead ends: 96 [2022-11-20 10:30:09,066 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:30:09,066 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-20 10:30:09,067 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-20 10:30:09,067 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-20 10:30:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:30:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-20 10:30:09,070 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-20 10:30:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-20 10:30:09,071 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 26 [2022-11-20 10:30:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:09,072 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-20 10:30:09,072 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-20 10:30:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-20 10:30:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 10:30:09,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:09,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:30:09,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:09,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 10:30:09,280 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-20 10:30:09,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913226, now seen corresponding path program 1 times [2022-11-20 10:30:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:09,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536157377] [2022-11-20 10:30:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:09,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:09,733 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-20 10:30:09,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:09,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536157377] [2022-11-20 10:30:09,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536157377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:09,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:09,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:30:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456078418] [2022-11-20 10:30:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:09,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:09,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:09,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:09,737 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-20 10:30:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:10,074 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-11-20 10:30:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:30:10,075 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-20 10:30:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:10,076 INFO L225 Difference]: With dead ends: 107 [2022-11-20 10:30:10,076 INFO L226 Difference]: Without dead ends: 107 [2022-11-20 10:30:10,076 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-20 10:30:10,077 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-20 10:30:10,077 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-20 10:30:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-20 10:30:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2022-11-20 10:30:10,080 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-20 10:30:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-20 10:30:10,080 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 26 [2022-11-20 10:30:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:10,081 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-20 10:30:10,081 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-20 10:30:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-20 10:30:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:30:10,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:10,082 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-20 10:30:10,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:30:10,082 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-20 10:30:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2022-11-20 10:30:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:10,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656776829] [2022-11-20 10:30:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:11,026 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-20 10:30:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:11,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656776829] [2022-11-20 10:30:11,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656776829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:11,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169969963] [2022-11-20 10:30:11,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:11,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:11,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:11,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:11,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:30:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:11,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 10:30:11,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:11,194 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-20 10:30:11,245 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:30:11,246 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-20 10:30:11,344 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-20 10:30:11,546 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-20 10:30:11,583 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-20 10:30:11,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:11,893 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-20 10:30:11,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169969963] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:11,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:11,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2022-11-20 10:30:11,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067694872] [2022-11-20 10:30:11,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:11,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 10:30:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:11,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 10:30:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 10:30:11,897 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-20 10:30:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:13,342 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-11-20 10:30:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:30:13,343 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-20 10:30:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:13,345 INFO L225 Difference]: With dead ends: 105 [2022-11-20 10:30:13,345 INFO L226 Difference]: Without dead ends: 105 [2022-11-20 10:30:13,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2022-11-20 10:30:13,347 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 833 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:13,351 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.5s Time] [2022-11-20 10:30:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-20 10:30:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2022-11-20 10:30:13,355 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-20 10:30:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-20 10:30:13,356 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 29 [2022-11-20 10:30:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:13,366 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-20 10:30:13,366 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-20 10:30:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-20 10:30:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:30:13,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:13,367 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-20 10:30:13,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:13,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:13,588 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-20 10:30:13,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687585, now seen corresponding path program 1 times [2022-11-20 10:30:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:13,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675221093] [2022-11-20 10:30:13,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:13,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,591 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-20 10:30:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:14,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675221093] [2022-11-20 10:30:14,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675221093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:14,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763666158] [2022-11-20 10:30:14,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:14,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:14,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:14,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:30:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:14,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-20 10:30:14,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:14,723 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-20 10:30:14,939 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:30:14,939 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-20 10:30:14,945 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-20 10:30:15,090 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-20 10:30:15,099 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-20 10:30:15,389 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-20 10:30:15,405 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-20 10:30:15,497 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-20 10:30:15,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:16,572 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-20 10:30:16,668 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-20 10:30:16,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763666158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:16,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:16,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 43 [2022-11-20 10:30:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30733817] [2022-11-20 10:30:16,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:16,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-20 10:30:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-20 10:30:16,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1772, Unknown=0, NotChecked=0, Total=1892 [2022-11-20 10:30:16,673 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-20 10:30:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:21,925 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2022-11-20 10:30:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 10:30:21,926 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-20 10:30:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:21,927 INFO L225 Difference]: With dead ends: 213 [2022-11-20 10:30:21,928 INFO L226 Difference]: Without dead ends: 213 [2022-11-20 10:30:21,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=818, Invalid=3738, Unknown=0, NotChecked=0, Total=4556 [2022-11-20 10:30:21,930 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2932 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2932 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:21,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2932 Valid, 904 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1109 Invalid, 0 Unknown, 102 Unchecked, 1.1s Time] [2022-11-20 10:30:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-20 10:30:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 84. [2022-11-20 10:30:21,933 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-20 10:30:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-11-20 10:30:21,934 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 29 [2022-11-20 10:30:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:21,934 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-11-20 10:30:21,934 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-20 10:30:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-11-20 10:30:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 10:30:21,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:21,935 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-20 10:30:21,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:22,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:22,141 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-20 10:30:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1082686446, now seen corresponding path program 2 times [2022-11-20 10:30:22,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:22,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269838675] [2022-11-20 10:30:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:22,284 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-20 10:30:22,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269838675] [2022-11-20 10:30:22,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269838675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432399220] [2022-11-20 10:30:22,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:30:22,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:22,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:22,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:22,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:30:22,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:30:22,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:30:22,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:30:22,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:22,456 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-20 10:30:22,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:30:22,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432399220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:22,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:30:22,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-20 10:30:22,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627632608] [2022-11-20 10:30:22,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:22,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:22,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:22,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:22,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:30:22,458 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-20 10:30:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:22,502 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-20 10:30:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:22,503 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-20 10:30:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:22,504 INFO L225 Difference]: With dead ends: 70 [2022-11-20 10:30:22,504 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 10:30:22,504 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-20 10:30:22,505 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 125 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:22,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 86 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:30:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 10:30:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-20 10:30:22,508 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-20 10:30:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-20 10:30:22,508 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 32 [2022-11-20 10:30:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:22,509 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-20 10:30:22,509 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-20 10:30:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-20 10:30:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:30:22,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:22,510 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-20 10:30:22,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:22,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:22,717 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-20 10:30:22,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:22,717 INFO L85 PathProgramCache]: Analyzing trace with hash -516260032, now seen corresponding path program 1 times [2022-11-20 10:30:22,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:22,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443640885] [2022-11-20 10:30:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:22,868 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-20 10:30:22,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:22,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443640885] [2022-11-20 10:30:22,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443640885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:22,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:22,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:30:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310611495] [2022-11-20 10:30:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:22,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:22,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:22,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:22,872 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-20 10:30:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:23,092 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-20 10:30:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:30:23,093 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-20 10:30:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:23,093 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:30:23,093 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 10:30:23,094 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-20 10:30:23,094 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-20 10:30:23,094 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-20 10:30:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 10:30:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2022-11-20 10:30:23,096 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-20 10:30:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-11-20 10:30:23,097 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 36 [2022-11-20 10:30:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:23,097 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-11-20 10:30:23,097 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-20 10:30:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-11-20 10:30:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:30:23,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:23,098 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-20 10:30:23,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:30:23,098 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-20 10:30:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash -516260031, now seen corresponding path program 1 times [2022-11-20 10:30:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:23,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426539567] [2022-11-20 10:30:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:23,219 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-20 10:30:23,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:23,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426539567] [2022-11-20 10:30:23,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426539567] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:23,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095020801] [2022-11-20 10:30:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:23,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:23,223 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:23,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:30:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:23,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:30:23,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:23,410 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-20 10:30:23,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:23,469 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-20 10:30:23,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095020801] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:23,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:23,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-11-20 10:30:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365644174] [2022-11-20 10:30:23,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:23,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:23,471 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-20 10:30:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:23,520 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-11-20 10:30:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:23,520 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-20 10:30:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:23,522 INFO L225 Difference]: With dead ends: 95 [2022-11-20 10:30:23,522 INFO L226 Difference]: Without dead ends: 95 [2022-11-20 10:30:23,522 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-20 10:30:23,523 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-20 10:30:23,523 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-20 10:30:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-20 10:30:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-11-20 10:30:23,526 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-20 10:30:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2022-11-20 10:30:23,526 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 36 [2022-11-20 10:30:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:23,527 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2022-11-20 10:30:23,528 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-20 10:30:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-11-20 10:30:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 10:30:23,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:23,534 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-20 10:30:23,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:23,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 10:30:23,740 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-20 10:30:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1215669110, now seen corresponding path program 1 times [2022-11-20 10:30:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:23,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753393452] [2022-11-20 10:30:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:23,912 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-20 10:30:23,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:23,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753393452] [2022-11-20 10:30:23,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753393452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:23,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586264260] [2022-11-20 10:30:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:23,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:23,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:23,915 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:23,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:30:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:24,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:30:24,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:24,107 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-20 10:30:24,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:24,175 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-20 10:30:24,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586264260] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:24,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:24,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-20 10:30:24,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970683435] [2022-11-20 10:30:24,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:24,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:30:24,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:24,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:30:24,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:30:24,177 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-20 10:30:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:24,239 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-11-20 10:30:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:30:24,240 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-20 10:30:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:24,240 INFO L225 Difference]: With dead ends: 90 [2022-11-20 10:30:24,240 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 10:30:24,241 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-20 10:30:24,241 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 148 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 164 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-20 10:30:24,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 164 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:30:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 10:30:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-11-20 10:30:24,244 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-20 10:30:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-11-20 10:30:24,245 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 37 [2022-11-20 10:30:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:24,245 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-11-20 10:30:24,245 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-20 10:30:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-11-20 10:30:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:30:24,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:24,246 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-20 10:30:24,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:24,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:30:24,451 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-20 10:30:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522149, now seen corresponding path program 2 times [2022-11-20 10:30:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:24,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421357415] [2022-11-20 10:30:24,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:24,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:24,592 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-20 10:30:24,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:24,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421357415] [2022-11-20 10:30:24,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421357415] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:24,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982285717] [2022-11-20 10:30:24,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:30:24,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:24,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:24,595 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:24,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:30:24,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:30:24,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:30:24,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:30:24,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:24,799 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-20 10:30:24,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:30:24,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982285717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:24,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:30:24,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-20 10:30:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616684841] [2022-11-20 10:30:24,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:24,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:30:24,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:24,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:30:24,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:30:24,801 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-20 10:30:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:24,842 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-20 10:30:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:24,843 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-20 10:30:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:24,843 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:30:24,844 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 10:30:24,844 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-20 10:30:24,844 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-20 10:30:24,845 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-20 10:30:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 10:30:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-11-20 10:30:24,848 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-20 10:30:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-11-20 10:30:24,849 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 41 [2022-11-20 10:30:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:24,849 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-11-20 10:30:24,849 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-20 10:30:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-11-20 10:30:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:30:24,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:24,851 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-20 10:30:24,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:25,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:30:25,056 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-20 10:30:25,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:25,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1972522204, now seen corresponding path program 1 times [2022-11-20 10:30:25,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:25,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851155280] [2022-11-20 10:30:25,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:25,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:25,356 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-20 10:30:25,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:25,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851155280] [2022-11-20 10:30:25,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851155280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:25,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:30:25,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:30:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459855734] [2022-11-20 10:30:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:25,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:30:25,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:25,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:30:25,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:30:25,362 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-20 10:30:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:25,632 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-11-20 10:30:25,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:30:25,633 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-20 10:30:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:25,634 INFO L225 Difference]: With dead ends: 107 [2022-11-20 10:30:25,634 INFO L226 Difference]: Without dead ends: 107 [2022-11-20 10:30:25,634 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-20 10:30:25,635 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-20 10:30:25,635 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-20 10:30:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-20 10:30:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2022-11-20 10:30:25,637 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-20 10:30:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-20 10:30:25,637 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 41 [2022-11-20 10:30:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:25,638 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-20 10:30:25,638 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-20 10:30:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-20 10:30:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 10:30:25,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:25,638 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-20 10:30:25,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:30:25,642 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-20 10:30:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash -333530929, now seen corresponding path program 1 times [2022-11-20 10:30:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:25,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723923688] [2022-11-20 10:30:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:25,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:26,901 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-20 10:30:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:26,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723923688] [2022-11-20 10:30:26,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723923688] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:26,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694270579] [2022-11-20 10:30:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:26,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:26,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:26,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:26,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:30:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:27,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 10:30:27,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:27,101 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-20 10:30:27,152 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:30:27,152 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-20 10:30:27,213 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-20 10:30:27,328 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:30:27,328 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-20 10:30:27,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:30:27,457 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-20 10:30:27,544 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-20 10:30:27,565 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-20 10:30:27,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:27,778 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-20 10:30:27,778 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-20 10:30:27,994 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (let ((.cse0 (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)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 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-20 10:30:28,015 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-20 10:30:28,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int))) (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))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_976) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))))) is different from false [2022-11-20 10:30:28,150 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-20 10:30:28,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:28,157 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-20 10:30:28,160 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-20 10:30:28,173 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-20 10:30:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 7 not checked. [2022-11-20 10:30:28,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694270579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:28,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:28,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 42 [2022-11-20 10:30:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131664078] [2022-11-20 10:30:28,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:28,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 10:30:28,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:28,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 10:30:28,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1343, Unknown=38, NotChecked=308, Total=1806 [2022-11-20 10:30:28,388 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-20 10:30:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:29,959 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-11-20 10:30:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 10:30:29,960 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-20 10:30:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:29,961 INFO L225 Difference]: With dead ends: 136 [2022-11-20 10:30:29,961 INFO L226 Difference]: Without dead ends: 136 [2022-11-20 10:30:29,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=442, Invalid=2958, Unknown=38, NotChecked=468, Total=3906 [2022-11-20 10:30:29,963 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 414 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 547 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:29,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 831 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 806 Invalid, 0 Unknown, 547 Unchecked, 0.5s Time] [2022-11-20 10:30:29,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-20 10:30:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2022-11-20 10:30:29,966 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-20 10:30:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-11-20 10:30:29,967 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 44 [2022-11-20 10:30:29,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:29,967 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-11-20 10:30:29,967 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-20 10:30:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-11-20 10:30:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 10:30:29,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:29,968 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-20 10:30:29,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:30,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:30:30,175 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-20 10:30:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:30,176 INFO L85 PathProgramCache]: Analyzing trace with hash -333530928, now seen corresponding path program 1 times [2022-11-20 10:30:30,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:30,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911234811] [2022-11-20 10:30:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:31,699 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-20 10:30:31,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:31,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911234811] [2022-11-20 10:30:31,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911234811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:31,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756732025] [2022-11-20 10:30:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:31,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:31,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:31,703 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:31,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:30:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:31,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-20 10:30:31,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:31,893 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-20 10:30:32,045 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:30:32,046 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-20 10:30:32,161 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-20 10:30:32,167 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-20 10:30:32,552 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:30:32,552 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-20 10:30:32,557 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-20 10:30:32,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:30:32,737 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-20 10:30:32,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:30:32,744 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-20 10:30:32,855 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-20 10:30:32,860 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-20 10:30:32,950 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-20 10:30:32,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:35,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:35,570 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-20 10:30:35,617 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-20 10:30:35,656 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-20 10:30:35,683 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-20 10:30:35,713 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-20 10:30:36,364 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-20 10:30:36,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756732025] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:36,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:36,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 51 [2022-11-20 10:30:36,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269082313] [2022-11-20 10:30:36,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:36,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 10:30:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 10:30:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2111, Unknown=4, NotChecked=380, Total=2652 [2022-11-20 10:30:36,368 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-20 10:30:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:47,966 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2022-11-20 10:30:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 10:30:47,966 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-20 10:30:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:47,967 INFO L225 Difference]: With dead ends: 149 [2022-11-20 10:30:47,967 INFO L226 Difference]: Without dead ends: 149 [2022-11-20 10:30:47,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=617, Invalid=4364, Unknown=5, NotChecked=564, Total=5550 [2022-11-20 10:30:47,969 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 832 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:47,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1591 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1046 Invalid, 0 Unknown, 543 Unchecked, 1.0s Time] [2022-11-20 10:30:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-20 10:30:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 90. [2022-11-20 10:30:47,973 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-20 10:30:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-11-20 10:30:47,974 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 44 [2022-11-20 10:30:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:47,974 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-11-20 10:30:47,975 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-20 10:30:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-11-20 10:30:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 10:30:47,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:47,976 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-20 10:30:47,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:48,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:48,182 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-20 10:30:48,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:48,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1958848316, now seen corresponding path program 2 times [2022-11-20 10:30:48,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:48,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566436230] [2022-11-20 10:30:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:48,341 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-20 10:30:48,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:48,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566436230] [2022-11-20 10:30:48,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566436230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:48,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818972355] [2022-11-20 10:30:48,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:30:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:48,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:48,344 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:48,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:30:48,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:30:48,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:30:48,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:30:48,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:48,607 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-20 10:30:48,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:30:48,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818972355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:30:48,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:30:48,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-20 10:30:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622779894] [2022-11-20 10:30:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:30:48,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:30:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:30:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:30:48,609 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-20 10:30:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:48,667 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-20 10:30:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:30:48,668 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-20 10:30:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:48,669 INFO L225 Difference]: With dead ends: 76 [2022-11-20 10:30:48,669 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 10:30:48,669 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-20 10:30:48,670 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-20 10:30:48,670 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-20 10:30:48,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 10:30:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-20 10:30:48,672 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-20 10:30:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-20 10:30:48,673 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 47 [2022-11-20 10:30:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:48,673 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-20 10:30:48,673 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-20 10:30:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-20 10:30:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 10:30:48,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:48,675 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-20 10:30:48,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:30:48,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:48,881 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-20 10:30:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash -645325999, now seen corresponding path program 1 times [2022-11-20 10:30:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:48,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491131827] [2022-11-20 10:30:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,226 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-20 10:30:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:30:51,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491131827] [2022-11-20 10:30:51,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491131827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:30:51,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345060560] [2022-11-20 10:30:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:51,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:30:51,231 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:30:51,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:30:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:30:51,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-20 10:30:51,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:30:51,473 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-20 10:30:51,709 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:30:51,710 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-20 10:30:51,904 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-20 10:30:51,910 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-20 10:30:52,495 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:30:52,496 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-20 10:30:52,504 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-20 10:30:52,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:30:52,511 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-20 10:30:52,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:30:52,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:30:52,775 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-20 10:30:52,785 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-20 10:30:52,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:30:52,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-20 10:30:53,138 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-20 10:30:53,150 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-20 10:30:53,284 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-20 10:30:53,478 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-20 10:30:53,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:30:54,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:54,806 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-20 10:30:54,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:54,821 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-20 10:30:54,836 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-20 10:30:54,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:54,908 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-20 10:30:54,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:54,925 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-20 10:30:54,935 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-20 10:30:55,010 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-20 10:30:55,103 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-20 10:30:55,153 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-20 10:30:55,246 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-20 10:30:55,285 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-20 10:30:55,323 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-20 10:30:55,431 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-20 10:30:55,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:30:55,450 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-20 10:30:55,454 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-20 10:30:55,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:30:55,460 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-20 10:30:55,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:30:55,467 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-20 10:30:55,473 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 10:30:55,474 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-20 10:30:55,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:30:55,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:30:55,909 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-20 10:30:55,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345060560] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:30:55,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:30:55,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 73 [2022-11-20 10:30:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781846407] [2022-11-20 10:30:55,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:30:55,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-20 10:30:55,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:30:55,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-20 10:30:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4022, Unknown=56, NotChecked=938, Total=5256 [2022-11-20 10:30:55,912 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-20 10:30:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:30:59,689 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-20 10:30:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 10:30:59,689 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-20 10:30:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:30:59,690 INFO L225 Difference]: With dead ends: 83 [2022-11-20 10:30:59,690 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 10:30:59,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=650, Invalid=7872, Unknown=62, NotChecked=1316, Total=9900 [2022-11-20 10:30:59,693 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 271 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:30:59,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1007 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1285 Invalid, 0 Unknown, 455 Unchecked, 0.9s Time] [2022-11-20 10:30:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 10:30:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2022-11-20 10:30:59,696 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-20 10:30:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-20 10:30:59,696 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2022-11-20 10:30:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:30:59,697 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-20 10:30:59,697 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-20 10:30:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-20 10:30:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 10:30:59,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:30:59,698 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-20 10:30:59,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-20 10:30:59,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:30:59,904 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-20 10:30:59,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:30:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1693462380, now seen corresponding path program 1 times [2022-11-20 10:30:59,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:30:59,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828503776] [2022-11-20 10:30:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:30:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:30:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:00,549 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-20 10:31:00,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:00,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828503776] [2022-11-20 10:31:00,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828503776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:00,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199890971] [2022-11-20 10:31:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:00,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:00,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:00,551 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:00,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:31:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:00,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-20 10:31:00,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:01,157 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-20 10:31:01,520 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-20 10:31:01,623 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-20 10:31:01,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:01,785 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-20 10:31:01,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:01,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:01,986 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-20 10:31:01,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199890971] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:01,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:01,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 12] total 34 [2022-11-20 10:31:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810179169] [2022-11-20 10:31:01,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:01,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 10:31:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 10:31:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 10:31:01,989 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-20 10:31:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:03,580 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-11-20 10:31:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:31:03,581 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-20 10:31:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:03,582 INFO L225 Difference]: With dead ends: 99 [2022-11-20 10:31:03,582 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 10:31:03,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2022-11-20 10:31:03,584 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1075 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:03,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 446 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:31:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 10:31:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2022-11-20 10:31:03,591 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-20 10:31:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-20 10:31:03,592 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 55 [2022-11-20 10:31:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:03,592 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-20 10:31:03,593 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-20 10:31:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-20 10:31:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 10:31:03,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:03,594 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-20 10:31:03,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:03,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:03,800 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-20 10:31:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash 261778123, now seen corresponding path program 2 times [2022-11-20 10:31:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:03,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361925715] [2022-11-20 10:31:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:03,992 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-20 10:31:03,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:03,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361925715] [2022-11-20 10:31:03,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361925715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:03,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937010667] [2022-11-20 10:31:03,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:31:03,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:03,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:03,995 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:04,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 10:31:04,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:31:04,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:31:04,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:31:04,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:04,299 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-20 10:31:04,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:04,397 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-20 10:31:04,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937010667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:04,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:04,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-20 10:31:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774622013] [2022-11-20 10:31:04,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:04,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:31:04,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:04,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:31:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:31:04,400 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-20 10:31:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:04,491 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-11-20 10:31:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:31:04,491 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-20 10:31:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:04,492 INFO L225 Difference]: With dead ends: 71 [2022-11-20 10:31:04,492 INFO L226 Difference]: Without dead ends: 71 [2022-11-20 10:31:04,492 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-20 10:31:04,493 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 82 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:04,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:31:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-20 10:31:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-20 10:31:04,495 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-20 10:31:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-20 10:31:04,496 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 58 [2022-11-20 10:31:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:04,496 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-20 10:31:04,500 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-20 10:31:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-20 10:31:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 10:31:04,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:04,501 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-20 10:31:04,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:04,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 10:31:04,708 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-20 10:31:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash 187254194, now seen corresponding path program 1 times [2022-11-20 10:31:04,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:04,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317452591] [2022-11-20 10:31:04,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:04,903 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-20 10:31:04,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:04,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317452591] [2022-11-20 10:31:04,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317452591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:04,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:04,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:31:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45932430] [2022-11-20 10:31:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:04,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:31:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:31:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:04,905 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-20 10:31:05,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:05,164 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-11-20 10:31:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:31:05,165 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-20 10:31:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:05,165 INFO L225 Difference]: With dead ends: 82 [2022-11-20 10:31:05,165 INFO L226 Difference]: Without dead ends: 82 [2022-11-20 10:31:05,166 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-20 10:31:05,166 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:05,167 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.2s Time] [2022-11-20 10:31:05,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-20 10:31:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-11-20 10:31:05,168 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-20 10:31:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-20 10:31:05,169 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 59 [2022-11-20 10:31:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:05,169 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-20 10:31:05,170 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-20 10:31:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-20 10:31:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 10:31:05,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:05,170 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-20 10:31:05,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 10:31:05,171 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-20 10:31:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash 187254195, now seen corresponding path program 1 times [2022-11-20 10:31:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:05,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128454044] [2022-11-20 10:31:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,476 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-20 10:31:05,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:05,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128454044] [2022-11-20 10:31:05,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128454044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:05,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:05,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:31:05,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20914688] [2022-11-20 10:31:05,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:05,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:31:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:05,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:31:05,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:05,478 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-20 10:31:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:05,776 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-20 10:31:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:31:05,777 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-20 10:31:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:05,778 INFO L225 Difference]: With dead ends: 80 [2022-11-20 10:31:05,778 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 10:31:05,778 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-20 10:31:05,779 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-20 10:31:05,779 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-20 10:31:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 10:31:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-20 10:31:05,781 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-20 10:31:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-20 10:31:05,781 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 59 [2022-11-20 10:31:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:05,781 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-20 10:31:05,782 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-20 10:31:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-20 10:31:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-20 10:31:05,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:05,782 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-20 10:31:05,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 10:31:05,783 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-20 10:31:05,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:05,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1509911310, now seen corresponding path program 1 times [2022-11-20 10:31:05,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:05,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175788214] [2022-11-20 10:31:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:05,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:05,926 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-20 10:31:05,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:05,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175788214] [2022-11-20 10:31:05,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175788214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:05,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:05,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:31:05,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373752854] [2022-11-20 10:31:05,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:05,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:31:05,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:05,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:31:05,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:05,929 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-20 10:31:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:06,118 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-11-20 10:31:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:31:06,119 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-20 10:31:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:06,120 INFO L225 Difference]: With dead ends: 77 [2022-11-20 10:31:06,120 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 10:31:06,120 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-20 10:31:06,121 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-20 10:31:06,121 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-20 10:31:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 10:31:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-11-20 10:31:06,123 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-20 10:31:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-11-20 10:31:06,123 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 60 [2022-11-20 10:31:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:06,123 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-11-20 10:31:06,123 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-20 10:31:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-11-20 10:31:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-20 10:31:06,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:06,124 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-20 10:31:06,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 10:31:06,124 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-20 10:31:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash -672727665, now seen corresponding path program 1 times [2022-11-20 10:31:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:06,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670632930] [2022-11-20 10:31:06,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:06,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:06,313 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-20 10:31:06,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:06,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670632930] [2022-11-20 10:31:06,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670632930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:31:06,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:31:06,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:31:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650162159] [2022-11-20 10:31:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:31:06,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:31:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:31:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:31:06,315 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-20 10:31:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:06,524 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-11-20 10:31:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:31:06,525 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-20 10:31:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:06,526 INFO L225 Difference]: With dead ends: 75 [2022-11-20 10:31:06,526 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 10:31:06,526 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-20 10:31:06,526 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-20 10:31:06,527 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-20 10:31:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 10:31:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-20 10:31:06,528 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-20 10:31:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-20 10:31:06,529 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 62 [2022-11-20 10:31:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:06,529 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-20 10:31:06,529 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-20 10:31:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-20 10:31:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:31:06,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:06,530 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-20 10:31:06,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 10:31:06,530 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-20 10:31:06,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash -912303337, now seen corresponding path program 1 times [2022-11-20 10:31:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:06,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644829270] [2022-11-20 10:31:06,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:06,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:07,854 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-20 10:31:07,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:07,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644829270] [2022-11-20 10:31:07,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644829270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:07,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507622853] [2022-11-20 10:31:07,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:07,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:07,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:07,856 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:07,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 10:31:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:08,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-20 10:31:08,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:08,086 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-20 10:31:08,152 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:31:08,153 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-20 10:31:08,204 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-20 10:31:08,421 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:31:08,422 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-20 10:31:08,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:08,521 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-20 10:31:08,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:08,687 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-20 10:31:08,836 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:31:08,836 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-20 10:31:08,842 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-20 10:31:08,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:09,460 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|) (= 1 (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_~head#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))))) is different from false [2022-11-20 10:31:09,650 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| (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_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-20 10:31:09,676 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-20 10:31:10,153 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_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_34|) (= (select (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (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_1843) |c_ULTIMATE.start_sll_create_~new_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-20 10:31:10,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:10,164 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-20 10:31:10,168 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-20 10:31:10,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:10,184 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-20 10:31:10,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 32 treesize of output 30 [2022-11-20 10:31:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2022-11-20 10:31:10,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507622853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:10,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:10,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 45 [2022-11-20 10:31:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415907078] [2022-11-20 10:31:10,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:10,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-20 10:31:10,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:10,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-20 10:31:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1548, Unknown=38, NotChecked=332, Total=2070 [2022-11-20 10:31:10,734 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-20 10:31:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:14,620 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-11-20 10:31:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:31:14,620 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-20 10:31:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:14,621 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:31:14,621 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 10:31:14,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=572, Invalid=3312, Unknown=38, NotChecked=500, Total=4422 [2022-11-20 10:31:14,623 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 285 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 538 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:14,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 428 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 654 Invalid, 0 Unknown, 538 Unchecked, 0.5s Time] [2022-11-20 10:31:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 10:31:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-11-20 10:31:14,626 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-20 10:31:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-11-20 10:31:14,627 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 65 [2022-11-20 10:31:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:14,627 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-11-20 10:31:14,627 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-20 10:31:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-11-20 10:31:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 10:31:14,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:14,628 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-20 10:31:14,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:14,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 10:31:14,835 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-20 10:31:14,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash -912303336, now seen corresponding path program 1 times [2022-11-20 10:31:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:14,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406338989] [2022-11-20 10:31:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:16,889 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-20 10:31:16,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:16,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406338989] [2022-11-20 10:31:16,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406338989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:16,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355849216] [2022-11-20 10:31:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:16,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:16,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:16,894 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:16,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 10:31:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:17,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-20 10:31:17,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:17,165 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-20 10:31:17,175 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-20 10:31:17,424 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:31:17,425 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-20 10:31:17,446 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:31:17,446 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-20 10:31:17,659 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-20 10:31:17,666 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-20 10:31:18,218 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:31:18,219 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-20 10:31:18,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:18,231 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-20 10:31:18,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:18,384 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-20 10:31:18,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:18,391 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-20 10:31:18,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:18,964 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-20 10:31:18,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:18,983 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-20 10:31:19,256 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-20 10:31:19,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:31:25,452 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-20 10:31:40,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:40,226 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-20 10:31:40,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:40,237 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-20 10:31:40,242 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-20 10:31:40,248 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-20 10:31:40,255 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-20 10:31:40,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:40,286 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-20 10:31:40,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:40,307 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-20 10:31:40,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:40,338 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-20 10:31:40,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:40,362 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-20 10:31:46,741 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-20 10:31:46,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355849216] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:31:46,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:31:46,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 27] total 71 [2022-11-20 10:31:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352858911] [2022-11-20 10:31:46,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:31:46,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-20 10:31:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:31:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-20 10:31:46,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4647, Unknown=36, NotChecked=138, Total=5112 [2022-11-20 10:31:46,744 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-20 10:31:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:31:52,981 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-20 10:31:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 10:31:52,981 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-20 10:31:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:31:52,982 INFO L225 Difference]: With dead ends: 90 [2022-11-20 10:31:52,982 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 10:31:52,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=1341, Invalid=8727, Unknown=36, NotChecked=198, Total=10302 [2022-11-20 10:31:52,985 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 948 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:31:52,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 634 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1171 Invalid, 0 Unknown, 340 Unchecked, 1.0s Time] [2022-11-20 10:31:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 10:31:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2022-11-20 10:31:52,988 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-20 10:31:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-20 10:31:52,989 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 65 [2022-11-20 10:31:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:31:52,989 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-20 10:31:52,989 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-20 10:31:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-20 10:31:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 10:31:52,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:31:52,990 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-20 10:31:52,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 10:31:53,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 10:31:53,197 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-20 10:31:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:31:53,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1783366217, now seen corresponding path program 1 times [2022-11-20 10:31:53,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:31:53,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603904863] [2022-11-20 10:31:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:31:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:54,699 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-20 10:31:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:31:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603904863] [2022-11-20 10:31:54,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603904863] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:31:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643137833] [2022-11-20 10:31:54,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:31:54,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:31:54,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:54,701 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:31:54,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 10:31:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:31:54,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-20 10:31:54,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:31:55,485 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-20 10:31:56,262 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:31:56,262 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-20 10:31:56,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:31:56,268 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-20 10:31:56,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:31:56,654 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-20 10:31:57,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:31:57,598 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-20 10:31:58,523 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-20 10:31:58,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:00,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:00,817 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-20 10:32:00,821 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-20 10:32:00,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:00,842 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-20 10:32:00,849 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-20 10:32:01,949 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-20 10:32:01,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643137833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:32:01,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:32:01,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-11-20 10:32:01,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204680605] [2022-11-20 10:32:01,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:01,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-20 10:32:01,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:01,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-20 10:32:01,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4820, Unknown=10, NotChecked=0, Total=5112 [2022-11-20 10:32:01,952 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-20 10:32:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:04,943 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-11-20 10:32:04,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-20 10:32:04,943 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-20 10:32:04,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:04,944 INFO L225 Difference]: With dead ends: 132 [2022-11-20 10:32:04,944 INFO L226 Difference]: Without dead ends: 132 [2022-11-20 10:32:04,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=539, Invalid=9955, Unknown=12, NotChecked=0, Total=10506 [2022-11-20 10:32:04,947 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:04,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1069 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 111 Unchecked, 0.0s Time] [2022-11-20 10:32:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-20 10:32:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2022-11-20 10:32:04,950 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-20 10:32:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-20 10:32:04,950 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 66 [2022-11-20 10:32:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:04,951 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-20 10:32:04,951 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-20 10:32:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-20 10:32:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 10:32:04,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:04,952 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-20 10:32:04,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:05,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:05,167 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-20 10:32:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash 124432906, now seen corresponding path program 1 times [2022-11-20 10:32:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:05,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264736557] [2022-11-20 10:32:05,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:06,693 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-20 10:32:06,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:06,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264736557] [2022-11-20 10:32:06,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264736557] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:06,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386574901] [2022-11-20 10:32:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:06,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:06,695 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:06,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 10:32:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:06,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 10:32:06,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:06,951 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-20 10:32:07,056 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:32:07,056 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-20 10:32:07,104 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-20 10:32:07,385 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:07,385 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-20 10:32:07,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:07,489 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-20 10:32:07,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:07,682 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-20 10:32:07,809 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-20 10:32:07,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:08,501 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-20 10:32:08,513 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-20 10:32:09,039 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-20 10:32:09,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:09,048 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-20 10:32:09,051 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-20 10:32:09,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:09,064 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-20 10:32:09,071 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-20 10:32:09,495 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 3 not checked. [2022-11-20 10:32:09,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386574901] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:32:09,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:32:09,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 46 [2022-11-20 10:32:09,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233774874] [2022-11-20 10:32:09,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:09,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-20 10:32:09,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:09,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-20 10:32:09,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1689, Unknown=59, NotChecked=258, Total=2162 [2022-11-20 10:32:09,499 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-20 10:32:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:12,873 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2022-11-20 10:32:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 10:32:12,875 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-20 10:32:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:12,876 INFO L225 Difference]: With dead ends: 88 [2022-11-20 10:32:12,876 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 10:32:12,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=753, Invalid=4312, Unknown=59, NotChecked=426, Total=5550 [2022-11-20 10:32:12,878 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 561 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:12,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 582 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 800 Invalid, 0 Unknown, 532 Unchecked, 0.7s Time] [2022-11-20 10:32:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 10:32:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2022-11-20 10:32:12,880 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-20 10:32:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-11-20 10:32:12,881 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 68 [2022-11-20 10:32:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:12,881 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-11-20 10:32:12,882 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-20 10:32:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-11-20 10:32:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-20 10:32:12,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:12,883 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-20 10:32:12,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:13,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:13,090 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-20 10:32:13,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash 424087740, now seen corresponding path program 2 times [2022-11-20 10:32:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:13,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211042181] [2022-11-20 10:32:13,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:16,538 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-20 10:32:16,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:16,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211042181] [2022-11-20 10:32:16,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211042181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:16,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290920373] [2022-11-20 10:32:16,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:32:16,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:16,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:16,540 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:16,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 10:32:16,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:32:16,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:32:16,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-20 10:32:16,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:16,816 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-20 10:32:16,892 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-20 10:32:16,901 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-20 10:32:16,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:16,922 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-20 10:32:16,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:16,930 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-20 10:32:17,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:32:17,028 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-20 10:32:17,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:32:17,036 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-20 10:32:17,095 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:32:17,095 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-20 10:32:17,124 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-20 10:32:17,129 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-20 10:32:17,152 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-20 10:32:17,160 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-20 10:32:17,219 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-20 10:32:17,225 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-20 10:32:17,951 INFO L321 Elim1Store]: treesize reduction 98, result has 41.0 percent of original size [2022-11-20 10:32:17,951 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-20 10:32:18,043 INFO L321 Elim1Store]: treesize reduction 52, result has 52.7 percent of original size [2022-11-20 10:32:18,044 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-20 10:32:18,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:18,931 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-11-20 10:32:18,932 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-20 10:32:18,985 INFO L321 Elim1Store]: treesize reduction 40, result has 54.0 percent of original size [2022-11-20 10:32:18,985 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-20 10:32:19,133 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-20 10:32:19,145 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:32:19,146 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-20 10:32:19,259 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-20 10:32:21,347 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-11-20 10:32:21,347 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-20 10:32:21,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:21,362 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-20 10:32:21,419 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-20 10:32:21,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:29,034 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-20 10:32:29,034 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-20 10:32:29,043 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-20 10:32:29,287 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-20 10:32:29,287 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-20 10:32:29,378 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-20 10:32:29,379 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-20 10:32:33,026 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-20 10:33:58,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:58,452 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 2 case distinctions, treesize of input 169 treesize of output 80 [2022-11-20 10:33:58,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:58,517 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-20 10:33:58,518 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 2123 treesize of output 2049 [2022-11-20 10:33:58,552 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 3818 treesize of output 3432 [2022-11-20 10:33:58,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:58,899 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 28 [2022-11-20 10:33:58,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:58,991 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 2869 treesize of output 2855 [2022-11-20 10:34:00,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:34:00,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:34:00,412 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 229 treesize of output 175 [2022-11-20 10:34:00,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:34:00,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:34:00,439 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 157 treesize of output 103 [2022-11-20 10:34:00,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:34:00,492 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 4201 treesize of output 4079 [2022-11-20 10:34:00,526 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 10034 treesize of output 9716 [2022-11-20 10:34:00,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:34:00,664 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 11193 treesize of output 10889 [2022-11-20 10:34:00,796 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 12546 treesize of output 11616 [2022-11-20 10:34:01,106 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 3325 treesize of output 3279 [2022-11-20 10:34:01,210 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 3163 treesize of output 3083 [2022-11-20 10:37:06,235 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 567 treesize of output 559 [2022-11-20 10:37:07,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:07,400 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 367 treesize of output 335 [2022-11-20 10:37:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 3 not checked. [2022-11-20 10:37:08,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290920373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:37:08,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:37:08,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 33] total 73 [2022-11-20 10:37:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710425085] [2022-11-20 10:37:08,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:37:08,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-20 10:37:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-20 10:37:08,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=4780, Unknown=41, NotChecked=140, Total=5256 [2022-11-20 10:37:08,673 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 73 states, 73 states have (on average 2.26027397260274) internal successors, (165), 73 states have internal predecessors, (165), 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-20 10:37:11,435 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or (let ((.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|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse9 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from true [2022-11-20 10:37:13,497 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (or (let ((.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|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse9 (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from true [2022-11-20 10:37:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:18,730 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2022-11-20 10:37:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 10:37:18,731 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.26027397260274) internal successors, (165), 73 states have internal predecessors, (165), 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 71 [2022-11-20 10:37:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:18,732 INFO L225 Difference]: With dead ends: 146 [2022-11-20 10:37:18,732 INFO L226 Difference]: Without dead ends: 146 [2022-11-20 10:37:18,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 103 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2238 ImplicationChecksByTransitivity, 105.1s TimeCoverageRelationStatistics Valid=624, Invalid=8087, Unknown=43, NotChecked=558, Total=9312 [2022-11-20 10:37:18,734 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 252 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 841 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:18,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1256 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 472 Invalid, 0 Unknown, 841 Unchecked, 0.8s Time] [2022-11-20 10:37:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-20 10:37:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2022-11-20 10:37:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 138 states have internal predecessors, (145), 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-20 10:37:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2022-11-20 10:37:18,739 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 71 [2022-11-20 10:37:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:18,739 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2022-11-20 10:37:18,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.26027397260274) internal successors, (165), 73 states have internal predecessors, (165), 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-20 10:37:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-11-20 10:37:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 10:37:18,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:18,740 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:18,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 10:37:18,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:18,946 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:37:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash 261816644, now seen corresponding path program 2 times [2022-11-20 10:37:18,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:18,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163139334] [2022-11-20 10:37:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 10:37:21,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:21,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163139334] [2022-11-20 10:37:21,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163139334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:37:21,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598671711] [2022-11-20 10:37:21,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:37:21,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:21,086 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:37:21,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 10:37:21,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:37:21,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:37:21,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-20 10:37:21,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:21,543 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-20 10:37:21,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-11-20 10:37:21,999 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-20 10:37:23,193 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:37:23,194 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 60 treesize of output 59 [2022-11-20 10:37:23,221 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:37:23,222 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 45 treesize of output 35 [2022-11-20 10:37:23,901 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 10:37:23,901 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 1 case distinctions, treesize of input 93 treesize of output 80 [2022-11-20 10:37:25,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:25,653 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 91 treesize of output 73 [2022-11-20 10:37:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 10:37:26,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:37:29,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:29,139 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 2 case distinctions, treesize of input 39 treesize of output 39 [2022-11-20 10:37:29,185 INFO L321 Elim1Store]: treesize reduction 12, result has 66.7 percent of original size [2022-11-20 10:37:29,186 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 2 case distinctions, treesize of input 63 treesize of output 73 [2022-11-20 10:37:29,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:29,203 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 117 treesize of output 107 [2022-11-20 10:37:29,211 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 86 treesize of output 82 [2022-11-20 10:38:07,943 WARN L233 SmtUtils]: Spent 38.21s on a formula simplification. DAG size of input: 56 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:38:16,216 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:38:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 10:38:40,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598671711] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:38:40,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:38:40,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 62 [2022-11-20 10:38:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43152944] [2022-11-20 10:38:40,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:38:40,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-20 10:38:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:38:40,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-20 10:38:40,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3684, Unknown=11, NotChecked=0, Total=3906 [2022-11-20 10:38:40,615 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand has 63 states, 62 states have (on average 2.7580645161290325) internal successors, (171), 63 states have internal predecessors, (171), 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-20 10:38:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:38:46,130 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-11-20 10:38:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 10:38:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.7580645161290325) internal successors, (171), 63 states have internal predecessors, (171), 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 72 [2022-11-20 10:38:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:38:46,132 INFO L225 Difference]: With dead ends: 141 [2022-11-20 10:38:46,132 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 10:38:46,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 80.8s TimeCoverageRelationStatistics Valid=467, Invalid=6328, Unknown=11, NotChecked=0, Total=6806 [2022-11-20 10:38:46,133 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 169 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 742 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:38:46,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 907 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 634 Invalid, 0 Unknown, 742 Unchecked, 1.1s Time] [2022-11-20 10:38:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 10:38:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-20 10:38:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 89 states have internal predecessors, (93), 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-20 10:38:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-11-20 10:38:46,136 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 72 [2022-11-20 10:38:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:38:46,136 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-11-20 10:38:46,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.7580645161290325) internal successors, (171), 63 states have internal predecessors, (171), 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-20 10:38:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-11-20 10:38:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-20 10:38:46,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:38:46,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 10:38:46,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-20 10:38:46,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:46,338 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-20 10:38:46,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:38:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 683637232, now seen corresponding path program 3 times [2022-11-20 10:38:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:38:46,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962146147] [2022-11-20 10:38:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:38:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:38:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 10:38:46,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:38:46,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962146147] [2022-11-20 10:38:46,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962146147] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:38:46,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660965758] [2022-11-20 10:38:46,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:38:46,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:46,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:38:46,483 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:38:46,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 10:38:47,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 10:38:47,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:38:47,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:38:47,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:38:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 10:38:47,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:38:47,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660965758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:38:47,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:38:47,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-20 10:38:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903103452] [2022-11-20 10:38:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:38:47,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:38:47,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:38:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:38:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:38:47,267 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-20 10:38:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:38:47,285 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-11-20 10:38:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:38:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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) Word has length 80 [2022-11-20 10:38:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:38:47,286 INFO L225 Difference]: With dead ends: 21 [2022-11-20 10:38:47,286 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:38:47,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:38:47,287 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:38:47,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:38:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:38:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:38:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-20 10:38:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:38:47,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-11-20 10:38:47,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:38:47,289 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:38:47,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-20 10:38:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:38:47,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:38:47,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-11-20 10:38:47,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-11-20 10:38:47,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-11-20 10:38:47,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-11-20 10:38:47,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-11-20 10:38:47,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2022-11-20 10:38:47,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-11-20 10:38:47,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-11-20 10:38:47,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-11-20 10:38:47,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-11-20 10:38:47,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-11-20 10:38:47,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-11-20 10:38:47,294 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-11-20 10:38:47,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-11-20 10:38:47,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-11-20 10:38:47,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2022-11-20 10:38:47,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-11-20 10:38:47,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-11-20 10:38:47,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-11-20 10:38:47,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2022-11-20 10:38:47,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-11-20 10:38:47,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 10:38:47,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:47,507 INFO L444 BasicCegarLoop]: Path program histogram: [3, 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] [2022-11-20 10:38:47,510 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:38:47,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:38:47 BoogieIcfgContainer [2022-11-20 10:38:47,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:38:47,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:38:47,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:38:47,518 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:38:47,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:05" (3/4) ... [2022-11-20 10:38:47,521 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:38:47,536 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-20 10:38:47,536 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-20 10:38:47,537 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 10:38:47,537 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:38:47,593 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:38:47,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:38:47,594 INFO L158 Benchmark]: Toolchain (without parser) took 523088.41ms. Allocated memory was 222.3MB in the beginning and 465.6MB in the end (delta: 243.3MB). Free memory was 189.7MB in the beginning and 204.0MB in the end (delta: -14.3MB). Peak memory consumption was 230.6MB. Max. memory is 16.1GB. [2022-11-20 10:38:47,594 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 138.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:38:47,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.93ms. Allocated memory is still 222.3MB. Free memory was 189.0MB in the beginning and 172.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 10:38:47,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.73ms. Allocated memory is still 222.3MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:38:47,595 INFO L158 Benchmark]: Boogie Preprocessor took 50.07ms. Allocated memory is still 222.3MB. Free memory was 170.2MB in the beginning and 168.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:38:47,595 INFO L158 Benchmark]: RCFGBuilder took 629.24ms. Allocated memory is still 222.3MB. Free memory was 168.1MB in the beginning and 149.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 10:38:47,595 INFO L158 Benchmark]: TraceAbstraction took 521736.92ms. Allocated memory was 222.3MB in the beginning and 465.6MB in the end (delta: 243.3MB). Free memory was 149.1MB in the beginning and 207.2MB in the end (delta: -58.0MB). Peak memory consumption was 186.6MB. Max. memory is 16.1GB. [2022-11-20 10:38:47,595 INFO L158 Benchmark]: Witness Printer took 76.46ms. Allocated memory is still 465.6MB. Free memory was 207.2MB in the beginning and 204.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:38:47,600 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 138.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.93ms. Allocated memory is still 222.3MB. Free memory was 189.0MB in the beginning and 172.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.73ms. Allocated memory is still 222.3MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.07ms. Allocated memory is still 222.3MB. Free memory was 170.2MB in the beginning and 168.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.24ms. Allocated memory is still 222.3MB. Free memory was 168.1MB in the beginning and 149.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 521736.92ms. Allocated memory was 222.3MB in the beginning and 465.6MB in the end (delta: 243.3MB). Free memory was 149.1MB in the beginning and 207.2MB in the end (delta: -58.0MB). Peak memory consumption was 186.6MB. Max. memory is 16.1GB. * Witness Printer took 76.46ms. Allocated memory is still 465.6MB. Free memory was 207.2MB in the beginning and 204.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 521.6s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 60.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12422 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12422 mSDsluCounter, 12483 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4751 IncrementalHoareTripleChecker+Unchecked, 10979 mSDsCounter, 307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10746 IncrementalHoareTripleChecker+Invalid, 15804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 307 mSolverCounterUnsat, 1504 mSDtfsCounter, 10746 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2625 GetRequests, 1465 SyntacticMatches, 63 SemanticMatches, 1097 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 14362 ImplicationChecksByTransitivity, 266.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=32, InterpolantAutomatonStates: 508, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 680 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 450.8s InterpolantComputationTime, 2465 NumberOfCodeBlocks, 2434 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 3198 ConstructedInterpolants, 360 QuantifiedInterpolants, 59734 SizeOfPredicates, 448 NumberOfNonLiveVariables, 7045 ConjunctsInSsa, 1066 ConjunctsInUnsatCore, 71 InterpolantComputations, 18 PerfectInterpolantSequences, 873/1634 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-20 10:38:47,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_372d07f5-eb9a-45ec-9e23-aff2631eeada/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE