./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:48:38,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:48:38,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:48:38,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:48:38,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:48:38,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:48:38,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:48:38,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:48:38,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:48:38,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:48:38,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:48:38,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:48:38,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:48:38,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:48:38,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:48:38,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:48:38,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:48:38,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:48:38,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:48:38,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:48:38,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:48:38,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:48:38,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:48:38,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:48:38,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:48:38,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:48:38,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:48:38,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:48:38,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:48:38,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:48:38,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:48:38,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:48:38,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:48:38,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:48:38,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:48:38,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:48:38,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:48:38,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:48:38,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:48:38,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:48:38,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:48:38,851 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:48:38,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:48:38,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:48:38,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:48:38,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:48:38,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:48:38,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:48:38,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:48:38,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:48:38,897 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:48:38,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:48:38,899 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:48:38,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:48:38,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:48:38,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:48:38,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:48:38,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:48:38,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:48:38,900 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:48:38,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:48:38,901 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:48:38,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:48:38,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:48:38,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:48:38,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:48:38,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:48:38,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:48:38,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:48:38,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:48:38,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:48:38,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:48:38,904 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:48:38,904 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:48:38,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:48:38,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-11-20 10:48:39,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:48:39,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:48:39,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:48:39,280 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:48:39,281 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:48:39,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-20 10:48:42,399 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:48:42,759 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:48:42,760 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-20 10:48:42,773 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/data/e65693f46/db395545b7594e5ebb4e5007a797a1f8/FLAG9b08032c4 [2022-11-20 10:48:42,789 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/data/e65693f46/db395545b7594e5ebb4e5007a797a1f8 [2022-11-20 10:48:42,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:48:42,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:48:42,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:48:42,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:48:42,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:48:42,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:48:42" (1/1) ... [2022-11-20 10:48:42,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6cd758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:42, skipping insertion in model container [2022-11-20 10:48:42,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:48:42" (1/1) ... [2022-11-20 10:48:42,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:48:42,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:48:43,157 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-20 10:48:43,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:48:43,173 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:48:43,217 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-20 10:48:43,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:48:43,245 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:48:43,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43 WrapperNode [2022-11-20 10:48:43,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:48:43,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:48:43,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:48:43,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:48:43,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,328 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2022-11-20 10:48:43,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:48:43,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:48:43,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:48:43,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:48:43,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,383 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:48:43,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:48:43,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:48:43,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:48:43,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (1/1) ... [2022-11-20 10:48:43,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:48:43,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:43,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:48:43,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:48:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:48:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:48:43,483 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 10:48:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 10:48:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:48:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:48:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:48:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:48:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:48:43,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:48:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:48:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:48:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:48:43,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:48:43,628 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:48:43,631 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:48:43,979 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:48:43,986 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:48:43,990 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 10:48:43,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:48:43 BoogieIcfgContainer [2022-11-20 10:48:43,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:48:43,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:48:43,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:48:43,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:48:43,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:48:42" (1/3) ... [2022-11-20 10:48:44,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab14254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:48:44, skipping insertion in model container [2022-11-20 10:48:44,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:48:43" (2/3) ... [2022-11-20 10:48:44,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab14254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:48:44, skipping insertion in model container [2022-11-20 10:48:44,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:48:43" (3/3) ... [2022-11-20 10:48:44,002 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-20 10:48:44,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:48:44,025 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:48:44,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:48:44,089 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@19aaff44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:48:44,090 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:48:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:48:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 10:48:44,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:44,105 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] [2022-11-20 10:48:44,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-11-20 10:48:44,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:44,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882596861] [2022-11-20 10:48:44,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:44,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:44,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:44,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882596861] [2022-11-20 10:48:44,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882596861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:44,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:44,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:48:44,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085071519] [2022-11-20 10:48:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:44,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:48:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:44,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:48:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:48:44,510 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:48:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:44,687 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-11-20 10:48:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:48:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-20 10:48:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:44,699 INFO L225 Difference]: With dead ends: 65 [2022-11-20 10:48:44,699 INFO L226 Difference]: Without dead ends: 28 [2022-11-20 10:48:44,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:48:44,707 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:44,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:48:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-20 10:48:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-20 10:48:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:48:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-20 10:48:44,753 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-11-20 10:48:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:44,754 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-20 10:48:44,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:48:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-20 10:48:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 10:48:44,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:44,757 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] [2022-11-20 10:48:44,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:48:44,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:44,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-11-20 10:48:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:44,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962187023] [2022-11-20 10:48:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:45,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:45,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962187023] [2022-11-20 10:48:45,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962187023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:45,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:45,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:48:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091367855] [2022-11-20 10:48:45,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:45,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:48:45,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:45,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:48:45,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:48:45,144 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:48:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:45,244 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-11-20 10:48:45,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:48:45,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-20 10:48:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:45,252 INFO L225 Difference]: With dead ends: 52 [2022-11-20 10:48:45,252 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 10:48:45,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:48:45,254 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:45,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:48:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 10:48:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-20 10:48:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:48:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-20 10:48:45,276 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-11-20 10:48:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:45,276 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-20 10:48:45,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:48:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-20 10:48:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 10:48:45,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:45,278 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:45,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:48:45,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:45,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-11-20 10:48:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:45,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670990590] [2022-11-20 10:48:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:45,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:48:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:48:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:48:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:46,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670990590] [2022-11-20 10:48:46,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670990590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:46,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843087328] [2022-11-20 10:48:46,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:46,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:46,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:48:46,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:48:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:46,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-20 10:48:46,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:47,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 10:48:47,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:47,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-20 10:48:47,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:48:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:48:47,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:47,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843087328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:47,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:48:47,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-11-20 10:48:47,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220967759] [2022-11-20 10:48:47,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:48:47,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 10:48:47,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 10:48:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=522, Unknown=3, NotChecked=0, Total=600 [2022-11-20 10:48:47,578 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:48,030 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-11-20 10:48:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:48:48,031 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2022-11-20 10:48:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:48,034 INFO L225 Difference]: With dead ends: 38 [2022-11-20 10:48:48,034 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 10:48:48,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=807, Unknown=3, NotChecked=0, Total=930 [2022-11-20 10:48:48,036 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:48,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 187 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-11-20 10:48:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 10:48:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-11-20 10:48:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:48:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-20 10:48:48,045 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-11-20 10:48:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:48,045 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-20 10:48:48,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-20 10:48:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 10:48:48,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:48,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:48,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:48,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:48,255 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:48,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-11-20 10:48:48,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:48,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208621971] [2022-11-20 10:48:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:49,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:48:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:49,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:48:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:48:49,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208621971] [2022-11-20 10:48:49,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208621971] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551673224] [2022-11-20 10:48:49,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:49,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:49,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:49,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:48:49,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:48:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:50,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-20 10:48:50,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:50,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:48:50,216 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 5 treesize of output 3 [2022-11-20 10:48:50,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:50,341 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 12 treesize of output 14 [2022-11-20 10:48:50,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:50,518 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 11 treesize of output 7 [2022-11-20 10:48:50,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:48:50,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:50,717 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 10:48:50,718 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 22 treesize of output 33 [2022-11-20 10:48:50,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-20 10:48:51,034 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 14 treesize of output 16 [2022-11-20 10:48:51,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-11-20 10:48:51,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-20 10:48:51,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:51,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 10:48:51,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:48:51,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:51,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:48:51,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:51,701 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 43 treesize of output 39 [2022-11-20 10:48:51,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:51,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:51,736 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-20 10:48:51,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 10:48:51,753 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 18 treesize of output 20 [2022-11-20 10:48:52,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:52,130 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-20 10:48:52,130 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 75 [2022-11-20 10:48:52,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-20 10:48:52,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:48:52,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 25 [2022-11-20 10:48:52,173 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 18 treesize of output 20 [2022-11-20 10:48:52,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-20 10:48:52,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:48:52,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:48:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:48:52,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:53,700 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_521 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_519))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_521)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_520))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_506))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_508) (select (select (store (store .cse3 .cse1 v_ArrVal_511) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse1 v_ArrVal_510) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2022-11-20 10:48:53,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551673224] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:53,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:48:53,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2022-11-20 10:48:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814686366] [2022-11-20 10:48:53,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:48:53,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 10:48:53,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:53,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 10:48:53,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1849, Unknown=86, NotChecked=88, Total=2162 [2022-11-20 10:48:53,709 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:49:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:00,446 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-11-20 10:49:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:49:00,447 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2022-11-20 10:49:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:00,448 INFO L225 Difference]: With dead ends: 57 [2022-11-20 10:49:00,448 INFO L226 Difference]: Without dead ends: 48 [2022-11-20 10:49:00,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=236, Invalid=2981, Unknown=93, NotChecked=112, Total=3422 [2022-11-20 10:49:00,450 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:00,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 361 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 492 Invalid, 0 Unknown, 97 Unchecked, 0.6s Time] [2022-11-20 10:49:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-20 10:49:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-11-20 10:49:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:49:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-11-20 10:49:00,463 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-11-20 10:49:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:00,464 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-11-20 10:49:00,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:49:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-11-20 10:49:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 10:49:00,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:00,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:00,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:00,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:49:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-11-20 10:49:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:00,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127265047] [2022-11-20 10:49:00,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:00,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:02,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:49:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:49:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:49:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:03,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127265047] [2022-11-20 10:49:03,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127265047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:03,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271542262] [2022-11-20 10:49:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:03,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:03,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:03,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:49:03,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:49:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:03,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 163 conjunts are in the unsatisfiable core [2022-11-20 10:49:03,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:03,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:49:04,060 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 5 treesize of output 3 [2022-11-20 10:49:04,296 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:49:04,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 10:49:04,538 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 11 treesize of output 7 [2022-11-20 10:49:04,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:49:04,783 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 10:49:04,783 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 22 treesize of output 33 [2022-11-20 10:49:04,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-20 10:49:04,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-20 10:49:04,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-20 10:49:05,229 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:49:05,229 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2022-11-20 10:49:05,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 20 [2022-11-20 10:49:05,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 20 [2022-11-20 10:49:05,593 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:49:05,594 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 40 [2022-11-20 10:49:05,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:49:05,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 10:49:06,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:06,060 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:49:06,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 67 [2022-11-20 10:49:06,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:06,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:06,095 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 10:49:06,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 10:49:06,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:06,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:06,117 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 25 treesize of output 30 [2022-11-20 10:49:06,132 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 18 treesize of output 20 [2022-11-20 10:49:07,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:07,035 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 10:49:07,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 151 [2022-11-20 10:49:07,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:07,106 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2022-11-20 10:49:07,107 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 7 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 96 [2022-11-20 10:49:07,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2022-11-20 10:49:07,135 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 18 treesize of output 20 [2022-11-20 10:49:07,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:07,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:07,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2022-11-20 10:49:07,272 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:49:07,273 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 44 [2022-11-20 10:49:07,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 16 [2022-11-20 10:49:07,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:49:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:49:07,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:49:07,577 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_720 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_720)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_717) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-20 10:49:09,615 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_720)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_717) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-20 10:49:12,647 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_720 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_720)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_723) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_717) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2022-11-20 10:49:12,788 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_717 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_737)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_735))) (let ((.cse5 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse3 .cse5) .cse6)) (.cse2 (select (select .cse4 .cse5) .cse6))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_736))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_720))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_723) (select (select (store (store .cse3 .cse1 v_ArrVal_717) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| |c_#StackHeapBarrier|)))) is different from false [2022-11-20 10:49:12,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271542262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:12,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:49:12,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2022-11-20 10:49:12,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165207939] [2022-11-20 10:49:12,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:49:12,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 10:49:12,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:12,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 10:49:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2079, Unknown=41, NotChecked=380, Total=2652 [2022-11-20 10:49:12,798 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:49:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:14,677 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-11-20 10:49:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:49:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2022-11-20 10:49:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:14,681 INFO L225 Difference]: With dead ends: 63 [2022-11-20 10:49:14,681 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 10:49:14,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=254, Invalid=2908, Unknown=46, NotChecked=452, Total=3660 [2022-11-20 10:49:14,684 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 86 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:14,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 295 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 658 Invalid, 0 Unknown, 39 Unchecked, 0.7s Time] [2022-11-20 10:49:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 10:49:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-11-20 10:49:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:49:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-20 10:49:14,713 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 37 [2022-11-20 10:49:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:14,715 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-20 10:49:14,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:49:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-20 10:49:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 10:49:14,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:14,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:14,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:14,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:14,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:49:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:14,929 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-11-20 10:49:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:14,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528434190] [2022-11-20 10:49:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:49:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:49:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:49:16,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:16,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528434190] [2022-11-20 10:49:16,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528434190] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:16,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550141587] [2022-11-20 10:49:16,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:49:16,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:16,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:49:16,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:49:16,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:49:16,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:49:16,876 WARN L261 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 204 conjunts are in the unsatisfiable core [2022-11-20 10:49:16,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:16,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:49:16,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:16,998 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 16 treesize of output 17 [2022-11-20 10:49:17,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:49:17,552 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:49:17,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 10:49:17,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:49:17,716 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-20 10:49:17,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 10:49:17,761 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 19 treesize of output 18 [2022-11-20 10:49:17,944 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 10:49:17,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 51 [2022-11-20 10:49:17,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-20 10:49:17,984 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 18 treesize of output 20 [2022-11-20 10:49:18,302 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-20 10:49:18,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 48 [2022-11-20 10:49:18,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:49:18,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:18,328 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:49:18,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 10:49:18,334 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 11 treesize of output 7 [2022-11-20 10:49:18,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:18,667 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 10:49:18,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 94 [2022-11-20 10:49:18,705 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 10:49:18,706 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 18 treesize of output 28 [2022-11-20 10:49:18,716 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 5 treesize of output 3 [2022-11-20 10:49:18,750 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 10:49:18,750 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 28 treesize of output 30 [2022-11-20 10:49:18,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:18,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:18,776 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 10:49:18,776 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 1 case distinctions, treesize of input 40 treesize of output 48 [2022-11-20 10:49:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:19,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:49:20,082 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_949) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_942) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-20 10:49:22,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550141587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:22,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:49:22,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2022-11-20 10:49:22,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485975465] [2022-11-20 10:49:22,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:49:22,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 10:49:22,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:22,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 10:49:22,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2361, Unknown=3, NotChecked=98, Total=2652 [2022-11-20 10:49:22,401 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:49:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:23,510 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-11-20 10:49:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:49:23,510 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2022-11-20 10:49:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:23,512 INFO L225 Difference]: With dead ends: 69 [2022-11-20 10:49:23,512 INFO L226 Difference]: Without dead ends: 58 [2022-11-20 10:49:23,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=232, Invalid=2739, Unknown=3, NotChecked=106, Total=3080 [2022-11-20 10:49:23,514 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:23,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 223 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 443 Invalid, 0 Unknown, 35 Unchecked, 0.6s Time] [2022-11-20 10:49:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-20 10:49:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-11-20 10:49:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:49:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-11-20 10:49:23,528 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 39 [2022-11-20 10:49:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:23,529 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-11-20 10:49:23,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:49:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-11-20 10:49:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 10:49:23,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:23,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-20 10:49:23,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:23,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:23,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:49:23,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2022-11-20 10:49:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:23,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751144529] [2022-11-20 10:49:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:23,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:49:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:49:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:49:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:26,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751144529] [2022-11-20 10:49:26,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751144529] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:26,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181553114] [2022-11-20 10:49:26,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:26,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:26,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:26,706 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:49:26,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:49:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:26,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-20 10:49:26,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:26,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:49:26,995 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 5 treesize of output 3 [2022-11-20 10:49:27,191 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:49:27,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 10:49:27,383 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 11 treesize of output 7 [2022-11-20 10:49:27,443 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 10:49:27,444 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 22 treesize of output 33 [2022-11-20 10:49:27,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-20 10:49:27,732 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:49:27,732 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 10:49:27,967 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 10:49:27,968 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2022-11-20 10:49:27,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 10:49:28,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:28,239 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:49:28,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2022-11-20 10:49:28,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:28,248 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 60 treesize of output 58 [2022-11-20 10:49:28,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:28,274 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-20 10:49:28,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2022-11-20 10:49:28,844 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-20 10:49:28,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 67 [2022-11-20 10:49:28,884 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 10:49:28,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 112 [2022-11-20 10:49:28,919 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-20 10:49:28,919 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 147 [2022-11-20 10:49:29,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 93 [2022-11-20 10:49:29,387 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-20 10:49:29,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 38 [2022-11-20 10:49:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:49:29,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:49:29,653 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1151))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1146) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-20 10:49:29,695 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1151))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1146) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-20 10:49:29,713 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1151))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1146) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-20 10:49:29,726 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1151))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1146) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-20 10:49:30,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181553114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:30,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:49:30,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 44 [2022-11-20 10:49:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31307813] [2022-11-20 10:49:30,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:49:30,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-20 10:49:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:30,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-20 10:49:30,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2127, Unknown=6, NotChecked=380, Total=2652 [2022-11-20 10:49:30,043 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 35 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 10:49:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:33,014 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-11-20 10:49:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 10:49:33,020 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 35 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2022-11-20 10:49:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:33,022 INFO L225 Difference]: With dead ends: 82 [2022-11-20 10:49:33,022 INFO L226 Difference]: Without dead ends: 79 [2022-11-20 10:49:33,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=305, Invalid=4261, Unknown=6, NotChecked=540, Total=5112 [2022-11-20 10:49:33,025 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 60 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:33,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 407 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 744 Invalid, 0 Unknown, 102 Unchecked, 0.8s Time] [2022-11-20 10:49:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-20 10:49:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2022-11-20 10:49:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 10:49:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2022-11-20 10:49:33,043 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 40 [2022-11-20 10:49:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:33,043 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2022-11-20 10:49:33,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 35 states have internal predecessors, (59), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 10:49:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2022-11-20 10:49:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:49:33,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:33,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-20 10:49:33,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:33,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:33,246 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:49:33,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2022-11-20 10:49:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:33,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514662618] [2022-11-20 10:49:33,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:35,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:36,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:49:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:49:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:49:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:36,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514662618] [2022-11-20 10:49:36,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514662618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:36,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078229751] [2022-11-20 10:49:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:36,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:36,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:49:36,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:49:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:37,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 172 conjunts are in the unsatisfiable core [2022-11-20 10:49:37,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:37,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:49:37,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 5 treesize of output 3 [2022-11-20 10:49:37,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:49:37,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:37,543 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 17 treesize of output 17 [2022-11-20 10:49:37,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:49:37,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:37,830 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 11 treesize of output 7 [2022-11-20 10:49:38,141 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:49:38,142 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 14 treesize of output 20 [2022-11-20 10:49:38,155 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 5 treesize of output 3 [2022-11-20 10:49:38,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:38,214 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 10:49:38,214 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 22 treesize of output 33 [2022-11-20 10:49:38,399 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 14 treesize of output 16 [2022-11-20 10:49:38,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-20 10:49:38,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-20 10:49:38,641 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:49:38,641 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 66 [2022-11-20 10:49:38,658 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 18 treesize of output 20 [2022-11-20 10:49:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:38,671 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 31 treesize of output 26 [2022-11-20 10:49:39,036 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:49:39,037 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 39 [2022-11-20 10:49:39,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:39,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 10:49:39,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:49:39,078 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 15 treesize of output 7 [2022-11-20 10:49:39,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:39,505 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:49:39,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 68 [2022-11-20 10:49:39,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:39,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:39,531 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 10:49:39,531 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 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-20 10:49:39,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:39,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:39,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:39,589 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 10:49:39,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 10:49:39,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-20 10:49:40,649 INFO L321 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2022-11-20 10:49:40,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 107 [2022-11-20 10:49:40,699 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 10:49:40,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 145 [2022-11-20 10:49:40,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:40,719 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2022-11-20 10:49:40,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:40,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:40,737 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:49:40,737 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 75 [2022-11-20 10:49:40,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:40,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:40,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:40,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2022-11-20 10:49:40,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 36 [2022-11-20 10:49:41,372 INFO L321 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2022-11-20 10:49:41,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 78 [2022-11-20 10:49:41,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:41,612 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 10:49:41,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 22 [2022-11-20 10:49:41,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:49:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:41,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:49:42,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1358)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1361))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1356) (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-11-20 10:49:42,713 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| Int) (v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1358)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1361))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1356) (select (select .cse1 .cse2) .cse3)) (+ 4 (select (select .cse4 .cse2) .cse3))))))) (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))))) is different from false [2022-11-20 10:49:42,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| Int) (v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1362 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1358)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1361))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1356) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)))))) is different from false [2022-11-20 10:49:47,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078229751] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:47,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:49:47,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2022-11-20 10:49:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784470990] [2022-11-20 10:49:47,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:49:47,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-20 10:49:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-20 10:49:47,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2765, Unknown=51, NotChecked=324, Total=3306 [2022-11-20 10:49:47,963 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 50 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:49:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:51,224 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-11-20 10:49:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:49:51,225 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-11-20 10:49:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:51,226 INFO L225 Difference]: With dead ends: 74 [2022-11-20 10:49:51,226 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 10:49:51,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=252, Invalid=3859, Unknown=61, NotChecked=384, Total=4556 [2022-11-20 10:49:51,228 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:51,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 295 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 689 Invalid, 0 Unknown, 61 Unchecked, 0.9s Time] [2022-11-20 10:49:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 10:49:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-20 10:49:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 10:49:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2022-11-20 10:49:51,254 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 41 [2022-11-20 10:49:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:51,254 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2022-11-20 10:49:51,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:49:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2022-11-20 10:49:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 10:49:51,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:51,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:51,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:51,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 10:49:51,459 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:49:51,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:51,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1003701405, now seen corresponding path program 2 times [2022-11-20 10:49:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:51,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388204446] [2022-11-20 10:49:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:51,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:49:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:51,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:49:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:51,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:49:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-20 10:49:51,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:51,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388204446] [2022-11-20 10:49:51,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388204446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:51,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836068672] [2022-11-20 10:49:51,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:49:51,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:51,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:51,592 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:49:51,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:49:51,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:49:51,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:49:51,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:49:51,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:49:51,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:49:51,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836068672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:49:51,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:49:51,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-20 10:49:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661671739] [2022-11-20 10:49:51,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:49:51,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:49:51,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:49:51,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:49:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:49:51,912 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:49:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:49:51,939 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-11-20 10:49:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:49:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-11-20 10:49:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:49:51,942 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:49:51,942 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 10:49:51,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:49:51,946 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:49:51,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:49:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 10:49:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-20 10:49:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:49:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-11-20 10:49:51,970 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 43 [2022-11-20 10:49:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:49:51,970 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-11-20 10:49:51,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:49:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-11-20 10:49:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-20 10:49:51,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:49:51,977 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:49:51,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:49:52,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:52,185 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:49:52,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:49:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2022-11-20 10:49:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:49:52,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523111827] [2022-11-20 10:49:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:52,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:49:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:49:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:49:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:54,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:49:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:49:54,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:49:54,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523111827] [2022-11-20 10:49:54,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523111827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:49:54,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903067081] [2022-11-20 10:49:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:49:54,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:49:54,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:49:54,867 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:49:54,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:49:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:49:55,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 160 conjunts are in the unsatisfiable core [2022-11-20 10:49:55,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:49:55,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:49:55,653 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 5 treesize of output 3 [2022-11-20 10:49:55,885 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:49:55,885 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 10:49:56,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-20 10:49:56,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-20 10:49:56,213 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:49:56,214 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-20 10:49:56,229 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 25 treesize of output 25 [2022-11-20 10:49:56,501 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:49:56,501 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 45 [2022-11-20 10:49:56,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 10:49:56,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2022-11-20 10:49:56,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:56,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:56,872 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 10:49:56,872 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 71 [2022-11-20 10:49:56,905 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 10:49:56,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 10:49:56,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:56,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:56,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 10:49:58,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:58,260 INFO L321 Elim1Store]: treesize reduction 195, result has 14.5 percent of original size [2022-11-20 10:49:58,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 13 case distinctions, treesize of input 210 treesize of output 122 [2022-11-20 10:49:58,303 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-11-20 10:49:58,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 328 treesize of output 207 [2022-11-20 10:49:58,365 INFO L321 Elim1Store]: treesize reduction 140, result has 13.6 percent of original size [2022-11-20 10:49:58,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 163 [2022-11-20 10:49:58,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:58,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:58,405 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-20 10:49:58,405 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 139 [2022-11-20 10:49:58,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:58,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:49:59,004 INFO L321 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2022-11-20 10:49:59,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 97 [2022-11-20 10:49:59,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:49:59,388 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 10:49:59,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 43 [2022-11-20 10:49:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:49:59,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:49:59,497 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1791))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1789))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-11-20 10:50:01,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903067081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:50:01,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:50:01,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 51 [2022-11-20 10:50:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864295007] [2022-11-20 10:50:01,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:50:01,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-20 10:50:01,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:50:01,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-20 10:50:01,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3021, Unknown=2, NotChecked=110, Total=3306 [2022-11-20 10:50:01,351 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 51 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:50:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:50:04,042 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-11-20 10:50:04,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 10:50:04,043 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-11-20 10:50:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:50:04,044 INFO L225 Difference]: With dead ends: 42 [2022-11-20 10:50:04,044 INFO L226 Difference]: Without dead ends: 39 [2022-11-20 10:50:04,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=318, Invalid=4514, Unknown=2, NotChecked=136, Total=4970 [2022-11-20 10:50:04,046 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:50:04,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 267 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 783 Invalid, 0 Unknown, 8 Unchecked, 0.8s Time] [2022-11-20 10:50:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-20 10:50:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-20 10:50:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:50:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-11-20 10:50:04,057 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 44 [2022-11-20 10:50:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:50:04,057 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-11-20 10:50:04,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 42 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 10:50:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-11-20 10:50:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 10:50:04,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:50:04,058 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-11-20 10:50:04,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 10:50:04,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:50:04,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:50:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:50:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1576200124, now seen corresponding path program 2 times [2022-11-20 10:50:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:50:04,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783132082] [2022-11-20 10:50:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:50:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:50:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:50:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:50:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:50:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:50:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:50:07,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:50:07,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783132082] [2022-11-20 10:50:07,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783132082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:50:07,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683622312] [2022-11-20 10:50:07,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:50:07,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:50:07,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:50:07,806 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:50:07,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6781a9ba-f0dc-4419-a4f6-0e095472d3ab/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:50:08,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:50:08,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:50:08,071 WARN L261 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 228 conjunts are in the unsatisfiable core [2022-11-20 10:50:08,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:50:08,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:50:08,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:50:08,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:08,243 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 16 treesize of output 17 [2022-11-20 10:50:08,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:50:08,593 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 5 treesize of output 3 [2022-11-20 10:50:08,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:50:08,924 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:50:08,925 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 14 treesize of output 20 [2022-11-20 10:50:08,969 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:50:08,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 10:50:08,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:50:09,147 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-20 10:50:09,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 10:50:09,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:50:09,399 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 10:50:09,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 66 [2022-11-20 10:50:09,409 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 31 treesize of output 26 [2022-11-20 10:50:09,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-20 10:50:09,787 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-20 10:50:09,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 51 [2022-11-20 10:50:09,796 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 11 treesize of output 7 [2022-11-20 10:50:09,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:09,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:09,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 10:50:09,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:50:10,041 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-20 10:50:10,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:10,243 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 10:50:10,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 101 [2022-11-20 10:50:10,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:10,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:10,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:10,291 INFO L321 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2022-11-20 10:50:10,292 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 2 case distinctions, treesize of input 40 treesize of output 68 [2022-11-20 10:50:10,348 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 10:50:10,348 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 28 treesize of output 30 [2022-11-20 10:50:10,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-20 10:50:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:12,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:13,198 INFO L321 Elim1Store]: treesize reduction 526, result has 29.4 percent of original size [2022-11-20 10:50:13,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 29 case distinctions, treesize of input 513 treesize of output 408 [2022-11-20 10:50:13,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:13,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:13,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:13,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:13,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:13,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:13,581 INFO L321 Elim1Store]: treesize reduction 284, result has 32.2 percent of original size [2022-11-20 10:50:13,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 253 treesize of output 332 [2022-11-20 10:50:13,699 INFO L321 Elim1Store]: treesize reduction 63, result has 36.4 percent of original size [2022-11-20 10:50:13,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 133 [2022-11-20 10:50:13,743 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 18 treesize of output 26 [2022-11-20 10:50:13,817 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 5 treesize of output 3 [2022-11-20 10:50:13,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-20 10:50:14,210 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 10:50:14,210 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 2 case distinctions, treesize of input 80 treesize of output 36 [2022-11-20 10:50:14,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:14,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:14,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:14,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:14,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:14,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:50:14,602 INFO L321 Elim1Store]: treesize reduction 84, result has 52.5 percent of original size [2022-11-20 10:50:14,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 149 treesize of output 178 [2022-11-20 10:50:14,892 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:50:14,893 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 91 [2022-11-20 10:50:14,983 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:50:14,983 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 80 [2022-11-20 10:51:07,233 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:07,641 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:09,204 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:10,045 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:10,464 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:11,841 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:12,888 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:13,553 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:56,557 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:56,961 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:58,426 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:59,130 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:51:59,554 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:01,031 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:01,944 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:02,628 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:19,496 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:21,484 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:21,784 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:22,809 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:23,257 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:24,080 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:25,140 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:26,390 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:26,729 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:27,452 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:28,902 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:29,244 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:29,950 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:52,414 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:52:53,373 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:55:12,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:12,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:55:12,821 INFO L217 Elim1Store]: Index analysis took 635 ms