./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R --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 db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- 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-38b53e6 [2022-11-25 17:00:01,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:00:01,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:00:01,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:00:01,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:00:01,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:00:01,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:00:01,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:00:01,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:00:01,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:00:01,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:00:02,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:00:02,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:00:02,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:00:02,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:00:02,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:00:02,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:00:02,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:00:02,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:00:02,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:00:02,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:00:02,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:00:02,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:00:02,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:00:02,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:00:02,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:00:02,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:00:02,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:00:02,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:00:02,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:00:02,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:00:02,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:00:02,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:00:02,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:00:02,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:00:02,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:00:02,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:00:02,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:00:02,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:00:02,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:00:02,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:00:02,057 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:00:02,098 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:00:02,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:00:02,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:00:02,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:00:02,100 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:00:02,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:00:02,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:00:02,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:00:02,102 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:00:02,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:00:02,103 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:00:02,104 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:00:02,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:00:02,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:00:02,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:00:02,105 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:00:02,105 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:00:02,105 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:00:02,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:00:02,105 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:00:02,106 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:00:02,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:00:02,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:00:02,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:00:02,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:00:02,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:00:02,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:00:02,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:00:02,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:00:02,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:00:02,108 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:00:02,109 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:00:02,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:00:02,109 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/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_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R 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 -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2022-11-25 17:00:02,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:00:02,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:00:02,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:00:02,464 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:00:02,465 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:00:02,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2022-11-25 17:00:05,487 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:00:05,746 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:00:05,752 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2022-11-25 17:00:05,784 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/data/4984d8a67/ed40be2e32574639af81feb1f5818f18/FLAG6035e8e98 [2022-11-25 17:00:05,819 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/data/4984d8a67/ed40be2e32574639af81feb1f5818f18 [2022-11-25 17:00:05,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:00:05,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:00:05,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:00:05,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:00:05,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:00:05,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:00:05" (1/1) ... [2022-11-25 17:00:05,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547e010d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:05, skipping insertion in model container [2022-11-25 17:00:05,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:00:05" (1/1) ... [2022-11-25 17:00:05,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:00:05,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:00:06,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:00:06,356 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:00:06,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:00:06,456 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:00:06,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06 WrapperNode [2022-11-25 17:00:06,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:00:06,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:00:06,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:00:06,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:00:06,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,553 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 302 [2022-11-25 17:00:06,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:00:06,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:00:06,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:00:06,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:00:06,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,636 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:00:06,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:00:06,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:00:06,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:00:06,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (1/1) ... [2022-11-25 17:00:06,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:00:06,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:00:06,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:00:06,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:00:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:00:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:00:06,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:00:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:00:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:00:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:00:06,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:00:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:00:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:00:06,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:00:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-11-25 17:00:06,738 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-11-25 17:00:06,856 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:00:06,858 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:00:07,907 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:00:07,916 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:00:07,916 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-25 17:00:07,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:00:07 BoogieIcfgContainer [2022-11-25 17:00:07,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:00:07,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:00:07,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:00:07,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:00:07,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:00:05" (1/3) ... [2022-11-25 17:00:07,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488b618f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:00:07, skipping insertion in model container [2022-11-25 17:00:07,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:00:06" (2/3) ... [2022-11-25 17:00:07,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488b618f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:00:07, skipping insertion in model container [2022-11-25 17:00:07,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:00:07" (3/3) ... [2022-11-25 17:00:07,936 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2022-11-25 17:00:07,956 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:00:07,956 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-11-25 17:00:08,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:00:08,037 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, 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;@23319a8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:00:08,038 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-11-25 17:00:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 159 states have (on average 2.138364779874214) internal successors, (340), 308 states have internal predecessors, (340), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 17:00:08,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 17:00:08,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:08,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 17:00:08,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-25 17:00:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:08,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467656217] [2022-11-25 17:00:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:08,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:08,266 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-25 17:00:08,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:08,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467656217] [2022-11-25 17:00:08,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467656217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:08,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:08,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:00:08,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411137490] [2022-11-25 17:00:08,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:08,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:00:08,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:08,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:00:08,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:00:08,358 INFO L87 Difference]: Start difference. First operand has 323 states, 159 states have (on average 2.138364779874214) internal successors, (340), 308 states have internal predecessors, (340), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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-25 17:00:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:08,924 INFO L93 Difference]: Finished difference Result 548 states and 601 transitions. [2022-11-25 17:00:08,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:00:08,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-25 17:00:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:08,941 INFO L225 Difference]: With dead ends: 548 [2022-11-25 17:00:08,942 INFO L226 Difference]: Without dead ends: 546 [2022-11-25 17:00:08,944 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-25 17:00:08,947 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 246 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:08,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 435 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:00:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-25 17:00:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 407. [2022-11-25 17:00:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 246 states have (on average 2.089430894308943) internal successors, (514), 392 states have internal predecessors, (514), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 17:00:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2022-11-25 17:00:09,025 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 3 [2022-11-25 17:00:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:09,025 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2022-11-25 17:00:09,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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-25 17:00:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2022-11-25 17:00:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 17:00:09,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:09,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 17:00:09,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:00:09,027 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-25 17:00:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:09,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520997844] [2022-11-25 17:00:09,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:09,118 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-25 17:00:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:09,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520997844] [2022-11-25 17:00:09,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520997844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:09,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:09,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:00:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916800732] [2022-11-25 17:00:09,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:09,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:00:09,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:09,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:00:09,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:00:09,122 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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-25 17:00:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:09,382 INFO L93 Difference]: Finished difference Result 408 states and 547 transitions. [2022-11-25 17:00:09,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:00:09,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-25 17:00:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:09,384 INFO L225 Difference]: With dead ends: 408 [2022-11-25 17:00:09,385 INFO L226 Difference]: Without dead ends: 408 [2022-11-25 17:00:09,385 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-25 17:00:09,386 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 6 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:09,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 553 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:00:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-25 17:00:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2022-11-25 17:00:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 246 states have (on average 2.0813008130081303) internal successors, (512), 390 states have internal predecessors, (512), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 17:00:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 542 transitions. [2022-11-25 17:00:09,403 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 542 transitions. Word has length 3 [2022-11-25 17:00:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:09,404 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 542 transitions. [2022-11-25 17:00:09,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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-25 17:00:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 542 transitions. [2022-11-25 17:00:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 17:00:09,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:09,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:09,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:00:09,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1117386190, now seen corresponding path program 1 times [2022-11-25 17:00:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:09,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075048737] [2022-11-25 17:00:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:09,535 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-25 17:00:09,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:09,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075048737] [2022-11-25 17:00:09,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075048737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:09,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:09,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:00:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903366396] [2022-11-25 17:00:09,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:09,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:00:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:00:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:00:09,538 INFO L87 Difference]: Start difference. First operand 405 states and 542 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:09,808 INFO L93 Difference]: Finished difference Result 400 states and 537 transitions. [2022-11-25 17:00:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:00:09,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 17:00:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:09,811 INFO L225 Difference]: With dead ends: 400 [2022-11-25 17:00:09,811 INFO L226 Difference]: Without dead ends: 400 [2022-11-25 17:00:09,812 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-25 17:00:09,819 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 43 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:09,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 496 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:00:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-25 17:00:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2022-11-25 17:00:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 246 states have (on average 2.0609756097560976) internal successors, (507), 385 states have internal predecessors, (507), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 17:00:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 537 transitions. [2022-11-25 17:00:09,842 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 537 transitions. Word has length 10 [2022-11-25 17:00:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:09,843 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 537 transitions. [2022-11-25 17:00:09,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 537 transitions. [2022-11-25 17:00:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 17:00:09,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:09,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:09,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:00:09,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1117386191, now seen corresponding path program 1 times [2022-11-25 17:00:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:09,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706805618] [2022-11-25 17:00:09,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:10,007 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-25 17:00:10,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:10,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706805618] [2022-11-25 17:00:10,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706805618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:10,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:10,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:00:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247116433] [2022-11-25 17:00:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:10,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:00:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:10,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:00:10,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:00:10,011 INFO L87 Difference]: Start difference. First operand 400 states and 537 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:10,252 INFO L93 Difference]: Finished difference Result 395 states and 532 transitions. [2022-11-25 17:00:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:00:10,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 17:00:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:10,256 INFO L225 Difference]: With dead ends: 395 [2022-11-25 17:00:10,256 INFO L226 Difference]: Without dead ends: 395 [2022-11-25 17:00:10,256 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-25 17:00:10,257 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 38 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:10,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 509 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:00:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-11-25 17:00:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-11-25 17:00:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 246 states have (on average 2.040650406504065) internal successors, (502), 380 states have internal predecessors, (502), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 17:00:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 532 transitions. [2022-11-25 17:00:10,269 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 532 transitions. Word has length 10 [2022-11-25 17:00:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:10,269 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 532 transitions. [2022-11-25 17:00:10,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 532 transitions. [2022-11-25 17:00:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:00:10,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:10,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:10,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:00:10,270 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:10,271 INFO L85 PathProgramCache]: Analyzing trace with hash 279233943, now seen corresponding path program 1 times [2022-11-25 17:00:10,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:10,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217524697] [2022-11-25 17:00:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:10,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:10,447 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-25 17:00:10,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:10,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217524697] [2022-11-25 17:00:10,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217524697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:10,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:10,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:00:10,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674417752] [2022-11-25 17:00:10,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:10,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:00:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:10,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:00:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:00:10,450 INFO L87 Difference]: Start difference. First operand 395 states and 532 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:11,168 INFO L93 Difference]: Finished difference Result 523 states and 574 transitions. [2022-11-25 17:00:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:00:11,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 17:00:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:11,171 INFO L225 Difference]: With dead ends: 523 [2022-11-25 17:00:11,171 INFO L226 Difference]: Without dead ends: 523 [2022-11-25 17:00:11,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:00:11,172 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 317 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:11,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 797 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:00:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-25 17:00:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 387. [2022-11-25 17:00:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 246 states have (on average 2.008130081300813) internal successors, (494), 372 states have internal predecessors, (494), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 17:00:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 524 transitions. [2022-11-25 17:00:11,184 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 524 transitions. Word has length 11 [2022-11-25 17:00:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:11,185 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 524 transitions. [2022-11-25 17:00:11,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2022-11-25 17:00:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:00:11,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:11,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:11,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:00:11,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash 279233944, now seen corresponding path program 1 times [2022-11-25 17:00:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:11,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262608723] [2022-11-25 17:00:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:11,421 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-25 17:00:11,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:11,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262608723] [2022-11-25 17:00:11,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262608723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:11,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:11,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:00:11,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592933335] [2022-11-25 17:00:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:11,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:00:11,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:00:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:00:11,424 INFO L87 Difference]: Start difference. First operand 387 states and 524 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:12,220 INFO L93 Difference]: Finished difference Result 513 states and 564 transitions. [2022-11-25 17:00:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:00:12,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 17:00:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:12,239 INFO L225 Difference]: With dead ends: 513 [2022-11-25 17:00:12,239 INFO L226 Difference]: Without dead ends: 513 [2022-11-25 17:00:12,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:00:12,240 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 803 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:12,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 440 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:00:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-11-25 17:00:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 378. [2022-11-25 17:00:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 246 states have (on average 1.967479674796748) internal successors, (484), 363 states have internal predecessors, (484), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 17:00:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 514 transitions. [2022-11-25 17:00:12,256 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 514 transitions. Word has length 11 [2022-11-25 17:00:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:12,257 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 514 transitions. [2022-11-25 17:00:12,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 514 transitions. [2022-11-25 17:00:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 17:00:12,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:12,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:12,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:00:12,259 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:12,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1620146378, now seen corresponding path program 1 times [2022-11-25 17:00:12,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:12,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82635501] [2022-11-25 17:00:12,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:12,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:12,747 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-25 17:00:12,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:12,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82635501] [2022-11-25 17:00:12,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82635501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:12,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:12,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:00:12,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666899198] [2022-11-25 17:00:12,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:12,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:00:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:00:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:00:12,750 INFO L87 Difference]: Start difference. First operand 378 states and 514 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:13,196 INFO L93 Difference]: Finished difference Result 398 states and 537 transitions. [2022-11-25 17:00:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:00:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 17:00:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:13,198 INFO L225 Difference]: With dead ends: 398 [2022-11-25 17:00:13,199 INFO L226 Difference]: Without dead ends: 398 [2022-11-25 17:00:13,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:00:13,200 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 32 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:13,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1566 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:00:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-25 17:00:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 386. [2022-11-25 17:00:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 253 states have (on average 1.9446640316205535) internal successors, (492), 370 states have internal predecessors, (492), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:00:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 524 transitions. [2022-11-25 17:00:13,214 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 524 transitions. Word has length 20 [2022-11-25 17:00:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:13,214 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 524 transitions. [2022-11-25 17:00:13,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 524 transitions. [2022-11-25 17:00:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 17:00:13,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:13,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:00:13,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:00:13,216 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:13,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash 248818477, now seen corresponding path program 1 times [2022-11-25 17:00:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:13,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670609795] [2022-11-25 17:00:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:13,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:13,754 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-25 17:00:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670609795] [2022-11-25 17:00:13,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670609795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:00:13,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:00:13,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 17:00:13,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019229899] [2022-11-25 17:00:13,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:00:13,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:00:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:13,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:00:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:00:13,758 INFO L87 Difference]: Start difference. First operand 386 states and 524 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:14,694 INFO L93 Difference]: Finished difference Result 526 states and 579 transitions. [2022-11-25 17:00:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:00:14,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 17:00:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:14,697 INFO L225 Difference]: With dead ends: 526 [2022-11-25 17:00:14,698 INFO L226 Difference]: Without dead ends: 526 [2022-11-25 17:00:14,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:00:14,699 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 753 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:14,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1269 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 17:00:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-25 17:00:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 389. [2022-11-25 17:00:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 256 states have (on average 1.93359375) internal successors, (495), 373 states have internal predecessors, (495), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 17:00:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2022-11-25 17:00:14,718 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 22 [2022-11-25 17:00:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:14,719 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2022-11-25 17:00:14,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:00:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2022-11-25 17:00:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:00:14,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:14,723 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-11-25 17:00:14,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:00:14,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:14,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1532217100, now seen corresponding path program 1 times [2022-11-25 17:00:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:14,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723206603] [2022-11-25 17:00:14,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:14,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:16,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:00:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:00:17,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:17,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723206603] [2022-11-25 17:00:17,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723206603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:00:17,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959828702] [2022-11-25 17:00:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:17,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:00:17,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:00:17,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:00:17,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:00:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:18,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-25 17:00:18,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:00:18,269 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-25 17:00:18,847 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-25 17:00:18,859 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-25 17:00:19,075 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:00:19,080 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 16 treesize of output 22 [2022-11-25 17:00:19,112 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:00:19,113 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 16 treesize of output 22 [2022-11-25 17:00:19,148 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-25 17:00:19,169 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-25 17:00:19,383 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:00:19,383 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 40 treesize of output 46 [2022-11-25 17:00:19,415 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:00:19,415 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 38 treesize of output 44 [2022-11-25 17:00:19,489 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 17:00:19,532 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 17:00:19,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:00:19,854 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-25 17:00:19,855 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 29 treesize of output 28 [2022-11-25 17:00:20,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:00:20,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 17:00:20,237 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-25 17:00:20,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:00:20,350 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 46 treesize of output 44 [2022-11-25 17:00:20,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-25 17:00:20,564 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 46 treesize of output 44 [2022-11-25 17:00:20,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-25 17:00:20,655 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 46 treesize of output 44 [2022-11-25 17:00:20,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-25 17:00:20,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:00:20,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-11-25 17:00:20,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:00:20,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 14 [2022-11-25 17:00:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:00:20,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:00:20,995 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_append_~head.offset 4))) (and (forall ((v_ArrVal_329 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_330) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_329) c_append_~head.base) .cse0)))) (forall ((v_ArrVal_330 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_330) c_append_~head.base) .cse0)))))) is different from false [2022-11-25 17:00:21,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:21,718 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 102 treesize of output 103 [2022-11-25 17:00:21,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:21,733 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 122 treesize of output 113 [2022-11-25 17:00:21,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:21,751 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 275 treesize of output 205 [2022-11-25 17:00:21,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:21,771 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 620 treesize of output 580 [2022-11-25 17:00:21,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:21,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 904 treesize of output 894 [2022-11-25 17:00:21,856 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 856 treesize of output 812 [2022-11-25 17:00:21,885 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 783 treesize of output 719 [2022-11-25 17:00:21,913 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 719 treesize of output 679 [2022-11-25 17:00:21,946 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 716 treesize of output 640 [2022-11-25 17:00:21,975 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 615 treesize of output 599 [2022-11-25 17:00:24,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959828702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:00:24,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:00:24,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2022-11-25 17:00:24,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658793252] [2022-11-25 17:00:24,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:00:24,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 17:00:24,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:24,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 17:00:24,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=961, Unknown=1, NotChecked=62, Total=1122 [2022-11-25 17:00:24,260 INFO L87 Difference]: Start difference. First operand 389 states and 527 transitions. Second operand has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:00:26,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:00:28,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:00:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:42,719 INFO L93 Difference]: Finished difference Result 1084 states and 1255 transitions. [2022-11-25 17:00:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 17:00:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-25 17:00:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:42,728 INFO L225 Difference]: With dead ends: 1084 [2022-11-25 17:00:42,728 INFO L226 Difference]: Without dead ends: 1084 [2022-11-25 17:00:42,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=404, Invalid=2569, Unknown=1, NotChecked=106, Total=3080 [2022-11-25 17:00:42,730 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 1951 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 5457 mSolverCounterSat, 374 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 5833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 5457 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:42,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 2658 Invalid, 5833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [374 Valid, 5457 Invalid, 2 Unknown, 0 Unchecked, 13.3s Time] [2022-11-25 17:00:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-11-25 17:00:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 438. [2022-11-25 17:00:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 288 states have (on average 1.8611111111111112) internal successors, (536), 408 states have internal predecessors, (536), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (61), 30 states have call predecessors, (61), 31 states have call successors, (61) [2022-11-25 17:00:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 628 transitions. [2022-11-25 17:00:42,779 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 628 transitions. Word has length 37 [2022-11-25 17:00:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:42,780 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 628 transitions. [2022-11-25 17:00:42,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 17:00:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 628 transitions. [2022-11-25 17:00:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:00:42,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:42,781 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-11-25 17:00:42,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 17:00:42,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 17:00:42,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1532217101, now seen corresponding path program 1 times [2022-11-25 17:00:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:42,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764533081] [2022-11-25 17:00:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:43,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:00:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:00:44,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:44,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764533081] [2022-11-25 17:00:44,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764533081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:00:44,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884597353] [2022-11-25 17:00:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:44,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:00:44,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:00:44,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:00:44,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:00:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:44,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 17:00:44,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:00:44,462 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-25 17:00:44,772 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-25 17:00:44,862 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:00:44,863 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 16 treesize of output 22 [2022-11-25 17:00:44,870 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-25 17:00:45,003 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:00:45,004 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 31 treesize of output 37 [2022-11-25 17:00:45,035 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 17:00:45,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:00:45,213 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-25 17:00:45,214 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 29 treesize of output 28 [2022-11-25 17:00:45,447 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-11-25 17:00:45,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-11-25 17:00:45,537 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 38 treesize of output 36 [2022-11-25 17:00:45,700 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 38 treesize of output 36 [2022-11-25 17:00:45,762 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 38 treesize of output 36 [2022-11-25 17:00:45,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:00:45,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-11-25 17:00:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:00:45,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:00:45,946 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_518) c_append_~head.base) (+ c_append_~head.offset 4))) 1)) is different from false [2022-11-25 17:00:46,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:46,252 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 33 treesize of output 34 [2022-11-25 17:00:46,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:46,266 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 170 treesize of output 118 [2022-11-25 17:00:46,278 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 78 [2022-11-25 17:00:46,287 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 40 treesize of output 36 [2022-11-25 17:00:46,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884597353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:00:46,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:00:46,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2022-11-25 17:00:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988369672] [2022-11-25 17:00:46,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:00:46,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 17:00:46,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:00:46,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 17:00:46,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=834, Unknown=2, NotChecked=58, Total=992 [2022-11-25 17:00:46,628 INFO L87 Difference]: Start difference. First operand 438 states and 628 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 23 states have internal predecessors, (63), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:00:48,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:00:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:00:52,107 INFO L93 Difference]: Finished difference Result 578 states and 681 transitions. [2022-11-25 17:00:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:00:52,108 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 23 states have internal predecessors, (63), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-11-25 17:00:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:00:52,111 INFO L225 Difference]: With dead ends: 578 [2022-11-25 17:00:52,111 INFO L226 Difference]: Without dead ends: 578 [2022-11-25 17:00:52,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=255, Invalid=1387, Unknown=2, NotChecked=78, Total=1722 [2022-11-25 17:00:52,113 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 863 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:00:52,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2425 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2412 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-11-25 17:00:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-25 17:00:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 443. [2022-11-25 17:00:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 293 states have (on average 1.8395904436860069) internal successors, (539), 413 states have internal predecessors, (539), 31 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (61), 30 states have call predecessors, (61), 31 states have call successors, (61) [2022-11-25 17:00:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 631 transitions. [2022-11-25 17:00:52,134 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 631 transitions. Word has length 37 [2022-11-25 17:00:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:00:52,134 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 631 transitions. [2022-11-25 17:00:52,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 23 states have internal predecessors, (63), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:00:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 631 transitions. [2022-11-25 17:00:52,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 17:00:52,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:00:52,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2022-11-25 17:00:52,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:00:52,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:00:52,344 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:00:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:00:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1913380289, now seen corresponding path program 1 times [2022-11-25 17:00:52,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:00:52,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897567764] [2022-11-25 17:00:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:00:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:00:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:00:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:00:53,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:00:53,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897567764] [2022-11-25 17:00:53,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897567764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:00:53,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064203754] [2022-11-25 17:00:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:00:53,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:00:53,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:00:53,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:00:53,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:00:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:00:54,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-25 17:00:54,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:00:54,199 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-25 17:00:54,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:00:54,501 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-25 17:00:54,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:00:54,751 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 26 treesize of output 28 [2022-11-25 17:00:54,773 INFO L321 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-11-25 17:00:54,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 24 [2022-11-25 17:00:54,867 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 36 [2022-11-25 17:00:54,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-25 17:00:55,054 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 36 [2022-11-25 17:00:55,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-25 17:00:55,125 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 36 [2022-11-25 17:00:55,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-25 17:00:55,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:00:55,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-25 17:00:55,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:00:55,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:55,229 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 32 treesize of output 17 [2022-11-25 17:00:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:00:55,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:00:55,376 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_append_~head.offset 4))) (and (forall ((v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_797) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_796) c_append_~head.base) .cse0)))) (forall ((v_ArrVal_797 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_797) c_append_~head.base) .cse0)))))) is different from false [2022-11-25 17:00:55,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:55,894 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 93 treesize of output 94 [2022-11-25 17:00:55,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:55,911 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 95 treesize of output 86 [2022-11-25 17:00:55,933 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 17:00:55,934 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 140 treesize of output 113 [2022-11-25 17:00:55,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:00:55,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 142 [2022-11-25 17:00:55,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:55,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 207 treesize of output 221 [2022-11-25 17:00:56,004 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 210 treesize of output 186 [2022-11-25 17:00:56,014 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 169 treesize of output 153 [2022-11-25 17:00:56,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:56,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 169 treesize of output 187 [2022-11-25 17:00:56,061 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 149 treesize of output 145 [2022-11-25 17:00:58,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:58,375 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 48 treesize of output 49 [2022-11-25 17:00:58,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:58,384 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 38 treesize of output 39 [2022-11-25 17:00:58,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:58,399 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 68 treesize of output 67 [2022-11-25 17:00:58,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:58,417 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 108 treesize of output 101 [2022-11-25 17:00:58,426 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 78 [2022-11-25 17:00:58,435 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 42 treesize of output 34 [2022-11-25 17:00:58,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:58,569 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-25 17:00:58,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:00:58,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:00:58,585 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 21 [2022-11-25 17:01:17,061 WARN L233 SmtUtils]: Spent 18.35s on a formula simplification. DAG size of input: 49 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:01:17,227 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 91 treesize of output 87 [2022-11-25 17:01:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2022-11-25 17:01:17,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064203754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:01:17,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:01:17,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-25 17:01:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30945850] [2022-11-25 17:01:17,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:01:17,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 17:01:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 17:01:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=778, Unknown=2, NotChecked=56, Total=930 [2022-11-25 17:01:17,917 INFO L87 Difference]: Start difference. First operand 443 states and 631 transitions. Second operand has 31 states, 27 states have (on average 4.148148148148148) internal successors, (112), 24 states have internal predecessors, (112), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 17:01:22,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:24,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:26,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:29,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:29,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_append_~head.offset 4))) (and (<= 0 c_append_~node~0.offset) (<= 9 (select |c_#length| c_append_~node~0.base)) (forall ((v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_797) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_796) c_append_~head.base) .cse0)))) (= |c_append_#in~head.base| c_append_~head.base) (<= c_append_~head.offset |c_append_#in~head.offset|) (= c_append_~node~0.offset 0) (= c_append_~head.offset |c_append_#in~head.offset|) (= (select |c_#valid| c_append_~node~0.base) 1) (forall ((v_ArrVal_797 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_797) c_append_~head.base) .cse0)))))) is different from false [2022-11-25 17:01:29,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_append_~head.offset 4))) (and (<= 0 c_append_~node~0.offset) (<= 9 (select |c_#length| c_append_~node~0.base)) (forall ((v_ArrVal_797 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_797) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_796) c_append_~head.base) .cse0)))) (= |c_append_#in~head.base| c_append_~head.base) (<= c_append_~head.offset |c_append_#in~head.offset|) (= (select |c_#valid| c_append_~head.base) 1) (= c_append_~node~0.offset 0) (= c_append_~head.offset |c_append_#in~head.offset|) (= (select |c_#valid| c_append_~node~0.base) 1) (forall ((v_ArrVal_797 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_797) c_append_~head.base) .cse0)))) (<= 0 c_append_~head.offset))) is different from false [2022-11-25 17:01:33,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:34,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:37,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:39,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:41,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:43,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:47,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:49,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:51,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:53,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:55,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:57,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:01:59,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:01,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:03,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:06,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:09,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:11,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:13,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:15,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:17,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:19,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:21,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:23,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:25,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:27,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:29,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:35,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:38,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:40,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:42,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:44,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:46,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:02:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:46,999 INFO L93 Difference]: Finished difference Result 1059 states and 1402 transitions. [2022-11-25 17:02:46,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 17:02:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.148148148148148) internal successors, (112), 24 states have internal predecessors, (112), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-11-25 17:02:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:47,006 INFO L225 Difference]: With dead ends: 1059 [2022-11-25 17:02:47,006 INFO L226 Difference]: Without dead ends: 1059 [2022-11-25 17:02:47,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=302, Invalid=1596, Unknown=6, NotChecked=258, Total=2162 [2022-11-25 17:02:47,008 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1487 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 4967 mSolverCounterSat, 339 mSolverCounterUnsat, 51 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 84.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 5814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 4967 IncrementalHoareTripleChecker+Invalid, 51 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 85.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:47,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 2794 Invalid, 5814 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [339 Valid, 4967 Invalid, 51 Unknown, 457 Unchecked, 85.0s Time] [2022-11-25 17:02:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-11-25 17:02:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 544. [2022-11-25 17:02:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 361 states have (on average 1.7285318559556786) internal successors, (624), 486 states have internal predecessors, (624), 61 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (121), 60 states have call predecessors, (121), 61 states have call successors, (121) [2022-11-25 17:02:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 806 transitions. [2022-11-25 17:02:47,043 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 806 transitions. Word has length 54 [2022-11-25 17:02:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:47,044 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 806 transitions. [2022-11-25 17:02:47,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.148148148148148) internal successors, (112), 24 states have internal predecessors, (112), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 17:02:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 806 transitions. [2022-11-25 17:02:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 17:02:47,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:47,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-25 17:02:47,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:02:47,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:02:47,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:02:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1156878274, now seen corresponding path program 2 times [2022-11-25 17:02:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:47,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564263601] [2022-11-25 17:02:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:02:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:02:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:02:48,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:48,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564263601] [2022-11-25 17:02:48,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564263601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:02:48,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447284926] [2022-11-25 17:02:48,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:02:48,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:02:48,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:02:48,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:02:48,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:02:49,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:02:49,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:02:49,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-25 17:02:49,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:49,155 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-25 17:02:49,447 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 11 treesize of output 7 [2022-11-25 17:02:49,517 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-25 17:02:49,593 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:02:49,594 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 1 case distinctions, treesize of input 23 treesize of output 27 [2022-11-25 17:02:49,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:02:49,604 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 7 [2022-11-25 17:02:49,707 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:02:49,708 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 1 case distinctions, treesize of input 28 treesize of output 32 [2022-11-25 17:02:49,841 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 17:02:49,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-25 17:03:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:13,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:03:13,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447284926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:03:13,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:03:13,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-11-25 17:03:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238157440] [2022-11-25 17:03:13,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:03:13,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 17:03:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 17:03:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=915, Unknown=30, NotChecked=0, Total=1056 [2022-11-25 17:03:13,219 INFO L87 Difference]: Start difference. First operand 544 states and 806 transitions. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 29 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:03:15,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:03:28,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:03:30,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:03:39,418 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 40 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:03:53,959 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 49 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:04:06,515 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 46 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:04:08,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:04:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:04:11,815 INFO L93 Difference]: Finished difference Result 582 states and 637 transitions. [2022-11-25 17:04:11,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 17:04:11,824 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 29 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2022-11-25 17:04:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:04:11,827 INFO L225 Difference]: With dead ends: 582 [2022-11-25 17:04:11,827 INFO L226 Difference]: Without dead ends: 544 [2022-11-25 17:04:11,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 69.2s TimeCoverageRelationStatistics Valid=466, Invalid=2675, Unknown=51, NotChecked=0, Total=3192 [2022-11-25 17:04:11,829 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 873 mSDsluCounter, 2632 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 140 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:04:11,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 2820 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2839 Invalid, 12 Unknown, 0 Unchecked, 12.9s Time] [2022-11-25 17:04:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-11-25 17:04:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 409. [2022-11-25 17:04:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 274 states have (on average 1.864963503649635) internal successors, (511), 391 states have internal predecessors, (511), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 17:04:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 547 transitions. [2022-11-25 17:04:11,848 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 547 transitions. Word has length 56 [2022-11-25 17:04:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:04:11,849 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 547 transitions. [2022-11-25 17:04:11,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 29 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:04:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 547 transitions. [2022-11-25 17:04:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-11-25 17:04:11,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:04:11,861 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:04:11,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:04:12,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 17:04:12,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:04:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:04:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash -365002613, now seen corresponding path program 1 times [2022-11-25 17:04:12,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:04:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380461861] [2022-11-25 17:04:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:04:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:04:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:04:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:51,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:04:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 17:04:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:53,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 17:04:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:54,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 17:04:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:54,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:04:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 17:04:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 17:04:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-25 17:04:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:57,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-25 17:04:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:58,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-25 17:04:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-25 17:04:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:04:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:04:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-25 17:05:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:01,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-25 17:05:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 473 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2022-11-25 17:05:02,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:05:02,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380461861] [2022-11-25 17:05:02,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380461861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:02,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107907932] [2022-11-25 17:05:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:02,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:02,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:02,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:02,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:05:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:05:04,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 2276 conjuncts, 444 conjunts are in the unsatisfiable core [2022-11-25 17:05:04,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:05:04,157 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-25 17:05:04,471 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 11 treesize of output 7 [2022-11-25 17:05:04,583 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-25 17:05:04,708 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:05:04,708 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 23 treesize of output 27 [2022-11-25 17:05:04,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-25 17:05:04,848 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:05:04,849 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 28 treesize of output 32 [2022-11-25 17:05:05,011 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 17:05:05,011 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 15 treesize of output 15 [2022-11-25 17:05:06,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:06,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:06,458 INFO L321 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-11-25 17:05:06,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 153 [2022-11-25 17:05:06,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:06,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 115 [2022-11-25 17:05:06,496 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-25 17:05:06,496 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 17 treesize of output 17 [2022-11-25 17:05:06,538 INFO L321 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-11-25 17:05:06,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 35 [2022-11-25 17:05:08,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:08,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:08,134 INFO L321 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-11-25 17:05:08,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 150 [2022-11-25 17:05:08,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:08,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 116 [2022-11-25 17:05:08,214 INFO L321 Elim1Store]: treesize reduction 77, result has 30.6 percent of original size [2022-11-25 17:05:08,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2022-11-25 17:05:10,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:10,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:10,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:10,237 INFO L321 Elim1Store]: treesize reduction 132, result has 23.7 percent of original size [2022-11-25 17:05:10,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 353 treesize of output 339 [2022-11-25 17:05:10,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:10,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 228 [2022-11-25 17:05:10,322 INFO L321 Elim1Store]: treesize reduction 77, result has 30.6 percent of original size [2022-11-25 17:05:10,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2022-11-25 17:05:11,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:11,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:11,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:12,059 INFO L321 Elim1Store]: treesize reduction 132, result has 23.7 percent of original size [2022-11-25 17:05:12,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 551 treesize of output 485 [2022-11-25 17:05:12,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:12,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 348 [2022-11-25 17:05:12,162 INFO L321 Elim1Store]: treesize reduction 77, result has 30.6 percent of original size [2022-11-25 17:05:12,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2022-11-25 17:05:12,400 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse1 (select .cse9 .cse4)) (.cse0 (select .cse9 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1)) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (or (exists ((v_DerPreprocessor_8 (Array Int Int))) (= .cse2 (select (let ((.cse3 (store .cse2 .cse4 .cse1))) (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_8) |c_ULTIMATE.start_main_~list~0#1.base| .cse3) .cse1 v_DerPreprocessor_8) |c_ULTIMATE.start_main_~list~0#1.base| .cse3)) .cse1))) (exists ((v_arrayElimCell_125 Int)) (and (not (= .cse0 v_arrayElimCell_125)) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| v_arrayElimCell_125))) (let ((.cse6 (let ((.cse8 (store .cse7 .cse4 .cse1))) (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_7) v_arrayElimCell_125 v_DerPreprocessor_8) |c_ULTIMATE.start_main_~list~0#1.base| .cse8) .cse1 v_DerPreprocessor_7) v_arrayElimCell_125 v_DerPreprocessor_8) |c_ULTIMATE.start_main_~list~0#1.base| .cse8)))) (let ((.cse5 (select .cse6 .cse1))) (and (= .cse2 .cse5) (= v_DerPreprocessor_7 .cse5) (= (select .cse6 v_arrayElimCell_125) .cse7)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_125)))))) (= (select |c_#valid| .cse0) 1)))) is different from true [2022-11-25 17:05:13,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:13,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:13,722 INFO L321 Elim1Store]: treesize reduction 169, result has 26.2 percent of original size [2022-11-25 17:05:13,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 725 treesize of output 622 [2022-11-25 17:05:13,839 INFO L321 Elim1Store]: treesize reduction 47, result has 27.7 percent of original size [2022-11-25 17:05:13,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 32 [2022-11-25 17:05:14,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:14,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 345 treesize of output 235 [2022-11-25 17:05:15,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:15,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:15,698 INFO L321 Elim1Store]: treesize reduction 169, result has 26.2 percent of original size [2022-11-25 17:05:15,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 445 treesize of output 422 [2022-11-25 17:05:15,779 INFO L321 Elim1Store]: treesize reduction 47, result has 27.7 percent of original size [2022-11-25 17:05:15,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 32 [2022-11-25 17:05:15,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:15,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 162 [2022-11-25 17:05:17,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:17,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:17,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:18,053 INFO L321 Elim1Store]: treesize reduction 132, result has 23.7 percent of original size [2022-11-25 17:05:18,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 323 treesize of output 321 [2022-11-25 17:05:18,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:18,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 350 treesize of output 232 [2022-11-25 17:05:18,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:05:18,145 INFO L321 Elim1Store]: treesize reduction 61, result has 35.8 percent of original size [2022-11-25 17:05:18,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2022-11-25 17:05:18,240 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-25 17:05:18,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 31 [2022-11-25 17:05:20,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:20,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:20,271 INFO L321 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2022-11-25 17:05:20,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 161 [2022-11-25 17:05:20,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:20,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 107 [2022-11-25 17:05:20,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:05:20,386 INFO L321 Elim1Store]: treesize reduction 91, result has 35.0 percent of original size [2022-11-25 17:05:20,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 72 [2022-11-25 17:05:20,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 33 [2022-11-25 17:05:21,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:21,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:21,802 INFO L321 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2022-11-25 17:05:21,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 175 [2022-11-25 17:05:21,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:21,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 115 [2022-11-25 17:05:21,918 INFO L321 Elim1Store]: treesize reduction 137, result has 31.8 percent of original size [2022-11-25 17:05:21,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 90 [2022-11-25 17:05:21,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 31 [2022-11-25 17:05:23,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:23,600 INFO L321 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-11-25 17:05:23,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 159 treesize of output 197 [2022-11-25 17:05:23,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:23,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 141 [2022-11-25 17:05:23,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:05:23,726 INFO L321 Elim1Store]: treesize reduction 121, result has 34.6 percent of original size [2022-11-25 17:05:23,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 90 [2022-11-25 17:05:25,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:25,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:25,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:25,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:25,282 INFO L321 Elim1Store]: treesize reduction 111, result has 21.3 percent of original size [2022-11-25 17:05:25,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 688 treesize of output 571 [2022-11-25 17:05:25,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:25,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 550 treesize of output 348 [2022-11-25 17:05:25,491 INFO L321 Elim1Store]: treesize reduction 205, result has 31.4 percent of original size [2022-11-25 17:05:25,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 58 treesize of output 126 [2022-11-25 17:05:27,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:27,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:27,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:27,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:27,353 INFO L321 Elim1Store]: treesize reduction 107, result has 24.1 percent of original size [2022-11-25 17:05:27,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 456 treesize of output 395 [2022-11-25 17:05:27,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:27,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 435 treesize of output 283 [2022-11-25 17:05:27,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:05:27,583 INFO L321 Elim1Store]: treesize reduction 189, result has 33.2 percent of original size [2022-11-25 17:05:27,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 58 treesize of output 126 [2022-11-25 17:05:29,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:29,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:29,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:29,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:29,978 INFO L321 Elim1Store]: treesize reduction 111, result has 21.3 percent of original size [2022-11-25 17:05:29,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 444 treesize of output 399 [2022-11-25 17:05:30,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:30,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 386 treesize of output 248 [2022-11-25 17:05:30,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:05:30,309 INFO L321 Elim1Store]: treesize reduction 257, result has 32.5 percent of original size [2022-11-25 17:05:30,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 26 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 68 treesize of output 162 [2022-11-25 17:05:30,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 19 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 31 [2022-11-25 17:05:33,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:33,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:33,646 INFO L321 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2022-11-25 17:05:33,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 231 treesize of output 245 [2022-11-25 17:05:33,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:05:33,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 155 [2022-11-25 17:05:33,936 INFO L321 Elim1Store]: treesize reduction 190, result has 32.1 percent of original size [2022-11-25 17:05:33,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 34 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 61 treesize of output 125 [2022-11-25 17:05:34,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 23 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 25 [2022-11-25 17:05:47,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 45 [2022-11-25 17:05:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 566 proven. 600 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-11-25 17:05:49,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:05:49,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107907932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:05:49,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:05:49,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 60] total 90 [2022-11-25 17:05:49,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675431346] [2022-11-25 17:05:49,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:05:49,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-11-25 17:05:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:05:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-11-25 17:05:49,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=7464, Unknown=124, NotChecked=178, Total=8372 [2022-11-25 17:05:49,598 INFO L87 Difference]: Start difference. First operand 409 states and 547 transitions. Second operand has 91 states, 80 states have (on average 2.425) internal successors, (194), 78 states have internal predecessors, (194), 17 states have call successors, (30), 3 states have call predecessors, (30), 12 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) [2022-11-25 17:06:07,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:13,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:16,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:26,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:28,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:32,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:35,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:40,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:43,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:46,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:48,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:54,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:56,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:06:58,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:02,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:05,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:07,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:10,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:13,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:16,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:23,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:31,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:34,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:35,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:37,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:38,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:40,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:41,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:43,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:07:55,775 WARN L233 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:08:11,997 WARN L233 SmtUtils]: Spent 9.34s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:08:28,120 WARN L233 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:08:59,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:09:36,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:10:19,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:10:21,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:10:24,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:10:59,089 WARN L233 SmtUtils]: Spent 12.42s on a formula simplification. DAG size of input: 166 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:11:01,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:02,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:35,970 WARN L233 SmtUtils]: Spent 12.18s on a formula simplification. DAG size of input: 166 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:11:37,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:39,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:42,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:43,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:47,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:50,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:53,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:56,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:11:58,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:01,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:03,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:06,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:08,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:11,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:14,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:16,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:18,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:21,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:23,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:26,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 17:12:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:26,390 INFO L93 Difference]: Finished difference Result 1016 states and 1116 transitions. [2022-11-25 17:12:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-25 17:12:26,865 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 80 states have (on average 2.425) internal successors, (194), 78 states have internal predecessors, (194), 17 states have call successors, (30), 3 states have call predecessors, (30), 12 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) Word has length 273 [2022-11-25 17:12:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:26,870 INFO L225 Difference]: With dead ends: 1016 [2022-11-25 17:12:26,870 INFO L226 Difference]: Without dead ends: 1016 [2022-11-25 17:12:26,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 284 SyntacticMatches, 65 SemanticMatches, 126 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7978 ImplicationChecksByTransitivity, 256.9s TimeCoverageRelationStatistics Valid=1207, Invalid=14312, Unknown=487, NotChecked=250, Total=16256 [2022-11-25 17:12:26,876 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 1813 mSDsluCounter, 6814 mSDsCounter, 0 mSdLazyCounter, 8531 mSolverCounterSat, 213 mSolverCounterUnsat, 2126 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 143.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 7019 SdHoareTripleChecker+Invalid, 11283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 8531 IncrementalHoareTripleChecker+Invalid, 2126 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 170.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:26,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1813 Valid, 7019 Invalid, 11283 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [213 Valid, 8531 Invalid, 2126 Unknown, 413 Unchecked, 170.8s Time] [2022-11-25 17:12:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2022-11-25 17:12:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 524. [2022-11-25 17:12:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 391 states have (on average 1.8721227621483376) internal successors, (732), 502 states have internal predecessors, (732), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-25 17:12:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 772 transitions. [2022-11-25 17:12:26,895 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 772 transitions. Word has length 273 [2022-11-25 17:12:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:26,896 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 772 transitions. [2022-11-25 17:12:26,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 80 states have (on average 2.425) internal successors, (194), 78 states have internal predecessors, (194), 17 states have call successors, (30), 3 states have call predecessors, (30), 12 states have return successors, (30), 18 states have call predecessors, (30), 17 states have call successors, (30) [2022-11-25 17:12:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 772 transitions. [2022-11-25 17:12:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-11-25 17:12:26,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:26,902 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:26,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:27,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 17:12:27,114 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-11-25 17:12:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash -365002612, now seen corresponding path program 1 times [2022-11-25 17:12:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:27,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024603247] [2022-11-25 17:12:27,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:56,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 17:12:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:12:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:58,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 17:12:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:00,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-25 17:13:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 17:13:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:03,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 17:13:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:05,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 17:13:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 17:13:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-25 17:13:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:09,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-25 17:13:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:10,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-25 17:13:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:11,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-25 17:13:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:13,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:13:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-25 17:13:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-25 17:13:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 345 proven. 935 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-11-25 17:13:18,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:13:18,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024603247] [2022-11-25 17:13:18,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024603247] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:13:18,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247211164] [2022-11-25 17:13:18,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:13:18,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:13:18,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:13:18,083 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:13:18,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_666879f5-f639-4917-8962-b70d99555e09/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:13:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:19,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 2276 conjuncts, 682 conjunts are in the unsatisfiable core [2022-11-25 17:13:19,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:13:19,365 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-25 17:13:19,710 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 11 treesize of output 7 [2022-11-25 17:13:19,723 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 11 treesize of output 7 [2022-11-25 17:13:19,829 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-25 17:13:19,845 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-25 17:13:20,010 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:13:20,010 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 23 treesize of output 27 [2022-11-25 17:13:20,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-25 17:13:20,050 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:13:20,051 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 23 treesize of output 27 [2022-11-25 17:13:20,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-11-25 17:13:20,186 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:13:20,187 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 28 treesize of output 32 [2022-11-25 17:13:20,207 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 17:13:20,208 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 28 treesize of output 32 [2022-11-25 17:13:20,399 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 17:13:20,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 15 treesize of output 15 [2022-11-25 17:13:21,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:21,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:21,845 INFO L321 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-11-25 17:13:21,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 206 [2022-11-25 17:13:21,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:21,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:21,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:21,879 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 17:13:21,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 60 [2022-11-25 17:13:21,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:21,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 135 [2022-11-25 17:13:21,916 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-25 17:13:21,917 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 17 treesize of output 17 [2022-11-25 17:13:21,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:21,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-25 17:13:23,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:23,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:24,164 INFO L321 Elim1Store]: treesize reduction 183, result has 20.1 percent of original size [2022-11-25 17:13:24,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 1032 treesize of output 848 [2022-11-25 17:13:24,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:24,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 829 treesize of output 521 [2022-11-25 17:13:24,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:24,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:24,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:24,323 INFO L321 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-11-25 17:13:24,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 173 [2022-11-25 17:13:24,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:24,364 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 26 treesize of output 27 [2022-11-25 17:13:24,410 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 10 treesize of output 9 [2022-11-25 17:13:24,503 INFO L321 Elim1Store]: treesize reduction 77, result has 30.6 percent of original size [2022-11-25 17:13:24,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2022-11-25 17:13:24,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:13:24,661 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 10 treesize of output 9 [2022-11-25 17:13:24,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:13:24,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 13 [2022-11-25 17:13:24,847 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-25 17:13:24,898 INFO L321 Elim1Store]: treesize reduction 25, result has 35.9 percent of original size [2022-11-25 17:13:24,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 55 [2022-11-25 17:13:26,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:26,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:27,042 INFO L321 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-11-25 17:13:27,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 347 treesize of output 369 [2022-11-25 17:13:27,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:27,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 279 [2022-11-25 17:13:27,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:27,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:27,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:27,171 INFO L321 Elim1Store]: treesize reduction 72, result has 45.0 percent of original size [2022-11-25 17:13:27,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 165 [2022-11-25 17:13:27,243 INFO L321 Elim1Store]: treesize reduction 77, result has 30.6 percent of original size [2022-11-25 17:13:27,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2022-11-25 17:13:27,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:13:27,374 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-25 17:13:27,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 33 [2022-11-25 17:13:27,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:27,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-25 17:13:29,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:29,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:29,482 INFO L321 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-11-25 17:13:29,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 234 [2022-11-25 17:13:29,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:29,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:29,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:29,544 INFO L321 Elim1Store]: treesize reduction 38, result has 41.5 percent of original size [2022-11-25 17:13:29,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 153 [2022-11-25 17:13:29,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:29,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 216 [2022-11-25 17:13:29,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:29,583 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 26 treesize of output 27 [2022-11-25 17:13:29,605 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 10 treesize of output 9 [2022-11-25 17:13:29,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:29,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 17:13:29,714 INFO L321 Elim1Store]: treesize reduction 107, result has 31.4 percent of original size [2022-11-25 17:13:29,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 72 [2022-11-25 17:13:29,785 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 10 treesize of output 9 [2022-11-25 17:13:29,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:13:29,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 13 [2022-11-25 17:13:29,909 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-25 17:13:31,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:31,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:32,123 INFO L321 Elim1Store]: treesize reduction 169, result has 26.2 percent of original size [2022-11-25 17:13:32,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 636 treesize of output 601 [2022-11-25 17:13:32,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:32,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:32,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:32,319 INFO L321 Elim1Store]: treesize reduction 171, result has 27.8 percent of original size [2022-11-25 17:13:32,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 394 treesize of output 462 [2022-11-25 17:13:32,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:13:32,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-25 17:13:32,512 INFO L321 Elim1Store]: treesize reduction 65, result has 29.3 percent of original size [2022-11-25 17:13:32,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 44 [2022-11-25 17:13:32,759 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 14 treesize of output 13 [2022-11-25 17:13:33,433 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-25 17:13:33,433 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 22 treesize of output 30 [2022-11-25 17:13:33,483 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 14 treesize of output 13 [2022-11-25 17:13:33,562 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-25 17:13:33,562 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 22 treesize of output 30 [2022-11-25 17:13:33,600 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 14 treesize of output 13 [2022-11-25 17:13:33,699 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 14 treesize of output 13 [2022-11-25 17:13:33,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:13:34,366 INFO L321 Elim1Store]: treesize reduction 396, result has 27.6 percent of original size [2022-11-25 17:13:34,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 33 case distinctions, treesize of input 404 treesize of output 417