./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 2329fc70 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_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 21:10:31,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:10:31,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:10:31,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:10:31,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:10:31,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:10:31,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:10:31,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:10:31,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:10:31,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:10:31,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:10:31,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:10:31,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:10:31,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:10:31,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:10:31,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:10:31,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:10:31,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:10:31,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:10:31,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:10:31,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:10:31,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:10:31,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:10:31,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:10:31,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:10:31,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:10:31,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:10:31,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:10:31,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:10:31,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:10:31,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:10:31,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:10:31,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:10:31,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:10:31,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:10:31,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:10:31,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:10:31,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:10:31,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:10:31,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:10:31,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:10:31,789 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:10:31,802 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:10:31,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:10:31,803 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:10:31,803 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:10:31,803 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:10:31,803 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:10:31,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:10:31,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:10:31,804 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:10:31,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:10:31,804 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:10:31,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:10:31,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:10:31,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:10:31,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:10:31,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:10:31,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:10:31,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:10:31,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:10:31,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:10:31,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:10:31,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:10:31,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:10:31,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:10:31,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:10:31,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:10:31,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:10:31,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:10:31,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:10:31,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:10:31,807 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:10:31,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:10:31,807 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:10:31,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:10:31,808 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:10:31,808 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/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_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8 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-12-13 21:10:31,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:10:31,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:10:31,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:10:31,992 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:10:31,992 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:10:31,994 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-12-13 21:10:34,573 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:10:34,773 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:10:34,773 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-12-13 21:10:34,784 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/data/6506c6d7d/d48cedc2bb934049987c9b585cab4a23/FLAGfcf88fa6c [2022-12-13 21:10:34,795 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/data/6506c6d7d/d48cedc2bb934049987c9b585cab4a23 [2022-12-13 21:10:34,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:10:34,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:10:34,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:10:34,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:10:34,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:10:34,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:10:34" (1/1) ... [2022-12-13 21:10:34,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4067060c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:34, skipping insertion in model container [2022-12-13 21:10:34,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:10:34" (1/1) ... [2022-12-13 21:10:34,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:10:34,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:10:35,048 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_07cbe38b-c969-4591-92b2-7bea7d811d52/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-12-13 21:10:35,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:10:35,057 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:10:35,086 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_07cbe38b-c969-4591-92b2-7bea7d811d52/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-12-13 21:10:35,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:10:35,103 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:10:35,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35 WrapperNode [2022-12-13 21:10:35,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:10:35,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:10:35,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:10:35,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:10:35,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,134 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2022-12-13 21:10:35,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:10:35,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:10:35,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:10:35,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:10:35,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,154 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:10:35,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:10:35,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:10:35,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:10:35,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (1/1) ... [2022-12-13 21:10:35,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:10:35,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:10:35,182 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:10:35,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:10:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:10:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:10:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 21:10:35,210 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 21:10:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 21:10:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:10:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:10:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 21:10:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 21:10:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:10:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 21:10:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:10:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:10:35,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:10:35,306 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:10:35,307 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:10:35,500 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:10:35,506 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:10:35,506 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 21:10:35,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:10:35 BoogieIcfgContainer [2022-12-13 21:10:35,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:10:35,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:10:35,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:10:35,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:10:35,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:10:34" (1/3) ... [2022-12-13 21:10:35,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f539fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:10:35, skipping insertion in model container [2022-12-13 21:10:35,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:35" (2/3) ... [2022-12-13 21:10:35,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f539fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:10:35, skipping insertion in model container [2022-12-13 21:10:35,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:10:35" (3/3) ... [2022-12-13 21:10:35,518 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-12-13 21:10:35,537 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:10:35,537 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:10:35,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:10:35,591 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;@d7c350a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:10:35,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 21:10:35,596 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-12-13 21:10:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 21:10:35,604 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:10:35,604 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-12-13 21:10:35,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:10:35,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:10:35,610 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-12-13 21:10:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:10:35,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379848335] [2022-12-13 21:10:35,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:10:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:35,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:10:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:35,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:10:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:10:35,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:10:35,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379848335] [2022-12-13 21:10:35,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379848335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:10:35,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:10:35,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:10:35,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180998561] [2022-12-13 21:10:35,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:10:35,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:10:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:10:35,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:10:35,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:10:35,919 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-12-13 21:10:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:10:35,985 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-12-13 21:10:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:10:35,987 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-12-13 21:10:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:10:35,994 INFO L225 Difference]: With dead ends: 65 [2022-12-13 21:10:35,994 INFO L226 Difference]: Without dead ends: 28 [2022-12-13 21:10:35,997 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-12-13 21:10:36,000 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:10:36,001 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.0s Time] [2022-12-13 21:10:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-13 21:10:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-13 21:10:36,033 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-12-13 21:10:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-12-13 21:10:36,035 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-12-13 21:10:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:10:36,036 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-12-13 21:10:36,037 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-12-13 21:10:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-12-13 21:10:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 21:10:36,038 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:10:36,038 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-12-13 21:10:36,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:10:36,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:10:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:10:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-12-13 21:10:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:10:36,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624905496] [2022-12-13 21:10:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:10:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:36,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:10:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:36,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:10:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:10:36,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:10:36,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624905496] [2022-12-13 21:10:36,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624905496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:10:36,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:10:36,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:10:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639849138] [2022-12-13 21:10:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:10:36,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:10:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:10:36,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:10:36,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:10:36,223 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-12-13 21:10:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:10:36,280 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-12-13 21:10:36,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:10:36,281 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-12-13 21:10:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:10:36,282 INFO L225 Difference]: With dead ends: 52 [2022-12-13 21:10:36,282 INFO L226 Difference]: Without dead ends: 31 [2022-12-13 21:10:36,282 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-12-13 21:10:36,283 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:10:36,284 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.0s Time] [2022-12-13 21:10:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-13 21:10:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-12-13 21:10:36,289 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-12-13 21:10:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-12-13 21:10:36,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-12-13 21:10:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:10:36,290 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-12-13 21:10:36,290 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-12-13 21:10:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-12-13 21:10:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 21:10:36,291 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:10:36,292 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-12-13 21:10:36,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:10:36,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:10:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:10:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-12-13 21:10:36,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:10:36,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371170320] [2022-12-13 21:10:36,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:36,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:10:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:10:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:36,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:10:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:36,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 21:10:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 21:10:36,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:10:36,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371170320] [2022-12-13 21:10:36,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371170320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:10:36,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738771275] [2022-12-13 21:10:36,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:36,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:10:36,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:10:36,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:10:36,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 21:10:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:36,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 21:10:36,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:10:37,241 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-12-13 21:10:37,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:37,342 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-12-13 21:10:37,384 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-12-13 21:10:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 21:10:37,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:10:37,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738771275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:10:37,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:10:37,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-12-13 21:10:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753969995] [2022-12-13 21:10:37,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:10:37,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 21:10:37,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:10:37,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 21:10:37,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=522, Unknown=3, NotChecked=0, Total=600 [2022-12-13 21:10:37,536 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-12-13 21:10:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:10:37,935 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-12-13 21:10:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 21:10:37,936 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-12-13 21:10:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:10:37,937 INFO L225 Difference]: With dead ends: 39 [2022-12-13 21:10:37,937 INFO L226 Difference]: Without dead ends: 31 [2022-12-13 21:10:37,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=839, Unknown=3, NotChecked=0, Total=992 [2022-12-13 21:10:37,939 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 100 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:10:37,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 178 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:10:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-13 21:10:37,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-12-13 21:10:37,945 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-12-13 21:10:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-12-13 21:10:37,946 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-12-13 21:10:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:10:37,946 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-12-13 21:10:37,947 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-12-13 21:10:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-12-13 21:10:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 21:10:37,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:10:37,948 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-12-13 21:10:37,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:10:38,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:10:38,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:10:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:10:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-12-13 21:10:38,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:10:38,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039562374] [2022-12-13 21:10:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:10:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:10:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:10:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 21:10:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 21:10:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:10:39,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039562374] [2022-12-13 21:10:39,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039562374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:10:39,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930560666] [2022-12-13 21:10:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:39,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:10:39,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:10:39,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:10:39,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 21:10:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:39,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 121 conjunts are in the unsatisfiable core [2022-12-13 21:10:39,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:10:39,282 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-12-13 21:10:39,316 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-12-13 21:10:39,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:39,382 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-12-13 21:10:39,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:39,490 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-12-13 21:10:39,528 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-12-13 21:10:39,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:39,605 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 21:10:39,606 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-12-13 21:10:39,688 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-12-13 21:10:39,800 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-12-13 21:10:40,003 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-12-13 21:10:40,009 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-12-13 21:10:40,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:40,016 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-12-13 21:10:40,021 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-12-13 21:10:40,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:40,165 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-12-13 21:10:40,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:40,179 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-12-13 21:10:40,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:40,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:40,194 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-13 21:10:40,194 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-12-13 21:10:40,200 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-12-13 21:10:40,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:40,422 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-13 21:10:40,422 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-12-13 21:10:40,430 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-12-13 21:10:40,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:40,437 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-12-13 21:10:40,443 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-12-13 21:10:40,494 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-12-13 21:10:40,498 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-12-13 21:10:40,535 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-12-13 21:10:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 21:10:40,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:10:42,839 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (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 (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-12-13 21:10:42,852 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= (let ((.cse0 (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 (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_505) |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 v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-12-13 21:10:42,915 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-12-13 21:10:42,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930560666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:10:42,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:10:42,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2022-12-13 21:10:42,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354954659] [2022-12-13 21:10:42,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:10:42,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 21:10:42,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:10:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 21:10:42,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1731, Unknown=36, NotChecked=258, Total=2162 [2022-12-13 21:10:42,921 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-12-13 21:10:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:10:46,420 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-12-13 21:10:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 21:10:46,421 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-12-13 21:10:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:10:46,421 INFO L225 Difference]: With dead ends: 66 [2022-12-13 21:10:46,421 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 21:10:46,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=455, Invalid=3811, Unknown=36, NotChecked=390, Total=4692 [2022-12-13 21:10:46,423 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 187 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 21:10:46,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 399 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 21:10:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 21:10:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2022-12-13 21:10:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 21:10:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-12-13 21:10:46,432 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 35 [2022-12-13 21:10:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:10:46,432 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-12-13 21:10:46,433 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-12-13 21:10:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-12-13 21:10:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 21:10:46,433 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:10:46,433 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-12-13 21:10:46,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 21:10:46,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:10:46,635 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:10:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:10:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-12-13 21:10:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:10:46,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348559443] [2022-12-13 21:10:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:10:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:10:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:47,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:10:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:47,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 21:10:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 21:10:48,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:10:48,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348559443] [2022-12-13 21:10:48,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348559443] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:10:48,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777162473] [2022-12-13 21:10:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:48,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:10:48,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:10:48,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:10:48,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 21:10:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:48,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 163 conjunts are in the unsatisfiable core [2022-12-13 21:10:48,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:10:48,536 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-12-13 21:10:48,581 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-12-13 21:10:48,680 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 21:10:48,681 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-12-13 21:10:48,798 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-12-13 21:10:48,846 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-12-13 21:10:48,916 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 21:10:48,917 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-12-13 21:10:48,997 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-12-13 21:10:49,009 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-12-13 21:10:49,015 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-12-13 21:10:49,122 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 21:10:49,122 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-12-13 21:10:49,128 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-12-13 21:10:49,137 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-12-13 21:10:49,315 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 21:10:49,316 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-12-13 21:10:49,322 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-12-13 21:10:49,327 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-12-13 21:10:49,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:49,535 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 21:10:49,535 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-12-13 21:10:49,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:49,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:49,553 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 21:10:49,553 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-12-13 21:10:49,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:49,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:49,568 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-12-13 21:10:49,576 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-12-13 21:10:50,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:50,063 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-13 21:10:50,063 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-12-13 21:10:50,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:50,098 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2022-12-13 21:10:50,098 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-12-13 21:10:50,110 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-12-13 21:10:50,116 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-12-13 21:10:50,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:50,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:50,122 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-12-13 21:10:50,202 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 21:10:50,202 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-12-13 21:10:50,206 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-12-13 21:10:50,260 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-12-13 21:10:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 21:10:50,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:10:50,401 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-12-13 21:10:52,708 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_~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-12-13 21:10:53,079 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-12-13 21:10:53,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777162473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:10:53,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:10:53,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2022-12-13 21:10:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968649673] [2022-12-13 21:10:53,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:10:53,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 21:10:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:10:53,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 21:10:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2134, Unknown=76, NotChecked=288, Total=2652 [2022-12-13 21:10:53,084 INFO L87 Difference]: Start difference. First operand 45 states and 54 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-12-13 21:10:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:10:55,555 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-12-13 21:10:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 21:10:55,556 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-12-13 21:10:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:10:55,557 INFO L225 Difference]: With dead ends: 65 [2022-12-13 21:10:55,557 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 21:10:55,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=349, Invalid=3361, Unknown=84, NotChecked=366, Total=4160 [2022-12-13 21:10:55,558 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 215 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 21:10:55,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 333 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 21:10:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 21:10:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2022-12-13 21:10:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 21:10:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-12-13 21:10:55,572 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 37 [2022-12-13 21:10:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:10:55,572 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-12-13 21:10:55,573 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-12-13 21:10:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-12-13 21:10:55,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 21:10:55,574 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:10:55,574 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-12-13 21:10:55,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 21:10:55,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:10:55,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:10:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:10:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-12-13 21:10:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:10:55,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775691946] [2022-12-13 21:10:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:10:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:10:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:10:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:56,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:10:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 21:10:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:10:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 21:10:56,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:10:56,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775691946] [2022-12-13 21:10:56,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775691946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:10:56,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85801657] [2022-12-13 21:10:56,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:10:56,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:10:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:10:56,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:10:56,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 21:10:56,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:10:56,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:10:56,940 WARN L261 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 204 conjunts are in the unsatisfiable core [2022-12-13 21:10:56,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:10:56,982 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-12-13 21:10:57,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:57,006 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-12-13 21:10:57,213 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-12-13 21:10:57,302 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 21:10:57,302 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-12-13 21:10:57,312 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-12-13 21:10:57,396 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-12-13 21:10:57,408 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-12-13 21:10:57,419 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-12-13 21:10:57,508 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 21:10:57,508 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-12-13 21:10:57,515 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-12-13 21:10:57,525 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-12-13 21:10:57,720 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 21:10:57,721 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-12-13 21:10:57,726 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-12-13 21:10:57,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:57,733 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 21:10:57,733 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-12-13 21:10:57,736 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-12-13 21:10:57,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:57,907 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 21:10:57,907 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-12-13 21:10:57,927 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 21:10:57,927 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-12-13 21:10:57,934 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-12-13 21:10:57,954 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 21:10:57,955 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-12-13 21:10:57,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:57,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:10:57,972 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 21:10:57,972 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-12-13 21:10:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:10:58,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:10:58,871 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-12-13 21:11:00,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85801657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:11:00,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:11:00,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2022-12-13 21:11:00,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587358853] [2022-12-13 21:11:00,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:11:00,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 21:11:00,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:00,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 21:11:00,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2361, Unknown=3, NotChecked=98, Total=2652 [2022-12-13 21:11:00,705 INFO L87 Difference]: Start difference. First operand 45 states and 54 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-12-13 21:11:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:11:02,879 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2022-12-13 21:11:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 21:11:02,880 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-12-13 21:11:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:11:02,880 INFO L225 Difference]: With dead ends: 71 [2022-12-13 21:11:02,881 INFO L226 Difference]: Without dead ends: 60 [2022-12-13 21:11:02,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=370, Invalid=3537, Unknown=3, NotChecked=122, Total=4032 [2022-12-13 21:11:02,882 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 81 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 21:11:02,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 198 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 21:11:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-13 21:11:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2022-12-13 21:11:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 21:11:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-12-13 21:11:02,893 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 39 [2022-12-13 21:11:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:11:02,893 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-12-13 21:11:02,893 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-12-13 21:11:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-12-13 21:11:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 21:11:02,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:11:02,894 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-12-13 21:11:02,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 21:11:03,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:11:03,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:11:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2022-12-13 21:11:03,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:03,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487305893] [2022-12-13 21:11:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:03,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:11:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:11:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 21:11:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 21:11:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:04,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487305893] [2022-12-13 21:11:04,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487305893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:11:04,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69723947] [2022-12-13 21:11:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:04,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:11:04,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:11:04,579 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:11:04,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 21:11:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:04,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 108 conjunts are in the unsatisfiable core [2022-12-13 21:11:04,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:11:04,683 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-12-13 21:11:04,690 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-12-13 21:11:04,787 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 21:11:04,787 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-12-13 21:11:04,887 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-12-13 21:11:04,921 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 21:11:04,921 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-12-13 21:11:05,001 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-12-13 21:11:05,090 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 21:11:05,090 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-12-13 21:11:05,243 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 21:11:05,243 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-12-13 21:11:05,248 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-12-13 21:11:05,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:05,418 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 21:11:05,418 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-12-13 21:11:05,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:05,424 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-12-13 21:11:05,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:05,441 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-12-13 21:11:05,441 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-12-13 21:11:05,765 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-13 21:11:05,766 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-12-13 21:11:05,788 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-13 21:11:05,789 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-12-13 21:11:05,805 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-12-13 21:11:05,805 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-12-13 21:11:05,887 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-12-13 21:11:06,096 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-12-13 21:11:06,096 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-12-13 21:11:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:11:06,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:11:06,274 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-12-13 21:11:06,286 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-12-13 21:11:06,298 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-12-13 21:11:06,305 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-12-13 21:11:06,358 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1158 (Array Int Int)) (v_ArrVal_1146 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| 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))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|) 0)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1159)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1158))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| 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 .cse2 .cse3 v_ArrVal_1146) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| 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-12-13 21:11:06,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69723947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:11:06,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:11:06,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 44 [2022-12-13 21:11:06,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901358246] [2022-12-13 21:11:06,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:11:06,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-13 21:11:06,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-13 21:11:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2037, Unknown=7, NotChecked=470, Total=2652 [2022-12-13 21:11:06,362 INFO L87 Difference]: Start difference. First operand 47 states and 56 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-12-13 21:11:09,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:11:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:11:12,956 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2022-12-13 21:11:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 21:11:12,957 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-12-13 21:11:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:11:12,957 INFO L225 Difference]: With dead ends: 128 [2022-12-13 21:11:12,958 INFO L226 Difference]: Without dead ends: 125 [2022-12-13 21:11:12,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=642, Invalid=5533, Unknown=7, NotChecked=790, Total=6972 [2022-12-13 21:11:12,959 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 593 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 49 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:11:12,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 534 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1378 Invalid, 7 Unknown, 0 Unchecked, 3.1s Time] [2022-12-13 21:11:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-13 21:11:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 69. [2022-12-13 21:11:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 21:11:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2022-12-13 21:11:12,978 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 40 [2022-12-13 21:11:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:11:12,978 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2022-12-13 21:11:12,978 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-12-13 21:11:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-12-13 21:11:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:11:12,979 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:11:12,979 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-12-13 21:11:12,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 21:11:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 21:11:13,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:11:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2022-12-13 21:11:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:13,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856411916] [2022-12-13 21:11:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:14,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:11:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:11:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 21:11:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 21:11:15,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:15,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856411916] [2022-12-13 21:11:15,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856411916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:11:15,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743885633] [2022-12-13 21:11:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:15,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:11:15,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:11:15,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:11:15,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 21:11:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:15,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 172 conjunts are in the unsatisfiable core [2022-12-13 21:11:15,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:11:15,257 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-12-13 21:11:15,294 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-12-13 21:11:15,385 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-12-13 21:11:15,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:15,440 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-12-13 21:11:15,609 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-12-13 21:11:15,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:15,613 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-12-13 21:11:15,788 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 21:11:15,789 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-12-13 21:11:15,795 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-12-13 21:11:15,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:15,823 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 21:11:15,823 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-12-13 21:11:15,906 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-12-13 21:11:15,912 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-12-13 21:11:15,918 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-12-13 21:11:16,058 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 21:11:16,058 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-12-13 21:11:16,067 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-12-13 21:11:16,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:16,075 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-12-13 21:11:16,270 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 21:11:16,270 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-12-13 21:11:16,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:16,276 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-12-13 21:11:16,281 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-12-13 21:11:16,285 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-12-13 21:11:16,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:16,493 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 21:11:16,493 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-12-13 21:11:16,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:16,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:16,508 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 21:11:16,508 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-12-13 21:11:16,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:16,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:16,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:16,532 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 21:11:16,532 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-12-13 21:11:16,540 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-12-13 21:11:17,124 INFO L321 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2022-12-13 21:11:17,125 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-12-13 21:11:17,153 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-13 21:11:17,153 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-12-13 21:11:17,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:17,163 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-12-13 21:11:17,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:17,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:17,171 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 21:11:17,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 75 [2022-12-13 21:11:17,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:17,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:17,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:17,179 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-12-13 21:11:17,185 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-12-13 21:11:17,497 INFO L321 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2022-12-13 21:11:17,498 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-12-13 21:11:17,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:17,607 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 21:11:17,607 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-12-13 21:11:17,657 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-12-13 21:11:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:17,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:11:33,531 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 ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (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 (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1358)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1361))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| v_ArrVal_1362)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1356) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))))))) is different from false [2022-12-13 21:11:33,635 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| Int) (|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_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1361 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1375)) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1376))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| (select (select .cse0 .cse1) .cse2))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select .cse9 .cse1) .cse2))) (let ((.cse8 (store (store .cse0 .cse4 (store (select .cse0 .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1358)) (.cse5 (store (store .cse9 .cse4 (store (select .cse9 .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1361))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1374))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_20| v_ArrVal_1362))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23| v_ArrVal_1356) (select (select .cse5 .cse6) .cse7)) (+ 4 (select (select .cse8 .cse6) .cse7))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_23|) 0)))))) is different from false [2022-12-13 21:11:33,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743885633] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:11:33,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:11:33,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2022-12-13 21:11:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398066356] [2022-12-13 21:11:33,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:11:33,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 21:11:33,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:33,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 21:11:33,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2780, Unknown=139, NotChecked=218, Total=3306 [2022-12-13 21:11:33,640 INFO L87 Difference]: Start difference. First operand 69 states and 84 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-12-13 21:11:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:11:38,823 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2022-12-13 21:11:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 21:11:38,824 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-12-13 21:11:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:11:38,825 INFO L225 Difference]: With dead ends: 86 [2022-12-13 21:11:38,825 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 21:11:38,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=418, Invalid=4695, Unknown=151, NotChecked=286, Total=5550 [2022-12-13 21:11:38,826 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 228 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:11:38,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 292 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 21:11:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 21:11:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2022-12-13 21:11:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 66 states have internal predecessors, (76), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 21:11:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2022-12-13 21:11:38,847 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 41 [2022-12-13 21:11:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:11:38,847 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2022-12-13 21:11:38,847 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-12-13 21:11:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2022-12-13 21:11:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 21:11:38,847 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:11:38,848 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-12-13 21:11:38,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 21:11:39,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 21:11:39,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:11:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2022-12-13 21:11:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:39,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072779980] [2022-12-13 21:11:39,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:40,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:11:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:11:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:40,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 21:11:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 21:11:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:40,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072779980] [2022-12-13 21:11:40,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072779980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:11:40,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521223961] [2022-12-13 21:11:40,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:40,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:11:40,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:11:40,702 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:11:40,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 21:11:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:40,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 162 conjunts are in the unsatisfiable core [2022-12-13 21:11:40,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:11:40,903 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-12-13 21:11:41,055 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-12-13 21:11:41,175 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 21:11:41,175 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-12-13 21:11:41,249 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-12-13 21:11:41,258 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-12-13 21:11:41,380 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 21:11:41,381 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-12-13 21:11:41,390 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-12-13 21:11:41,579 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 21:11:41,579 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-12-13 21:11:41,584 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-12-13 21:11:41,589 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-12-13 21:11:41,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:41,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:41,792 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 21:11:41,792 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-12-13 21:11:41,815 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 21:11:41,816 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-12-13 21:11:41,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:41,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:41,826 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-12-13 21:11:42,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:42,696 INFO L321 Elim1Store]: treesize reduction 195, result has 14.5 percent of original size [2022-12-13 21:11:42,697 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-12-13 21:11:42,721 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-12-13 21:11:42,722 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-12-13 21:11:42,748 INFO L321 Elim1Store]: treesize reduction 140, result has 13.6 percent of original size [2022-12-13 21:11:42,748 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-12-13 21:11:42,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:42,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:42,770 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-12-13 21:11:42,770 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-12-13 21:11:43,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:43,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:43,142 INFO L321 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2022-12-13 21:11:43,143 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-12-13 21:11:43,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 21:11:43,409 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 21:11:43,409 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-12-13 21:11:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:43,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:11:43,484 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1570 (Array Int Int))) (not (let ((.cse1 (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_1570))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (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_1569))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))) is different from false [2022-12-13 21:11:44,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521223961] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:11:44,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:11:44,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 51 [2022-12-13 21:11:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104244774] [2022-12-13 21:11:44,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:11:44,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 21:11:44,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:44,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 21:11:44,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3017, Unknown=1, NotChecked=110, Total=3306 [2022-12-13 21:11:44,969 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 51 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 42 states have internal predecessors, (69), 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-12-13 21:11:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:11:49,463 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-12-13 21:11:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 21:11:49,464 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 42 states have internal predecessors, (69), 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-12-13 21:11:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:11:49,465 INFO L225 Difference]: With dead ends: 93 [2022-12-13 21:11:49,465 INFO L226 Difference]: Without dead ends: 90 [2022-12-13 21:11:49,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=555, Invalid=5610, Unknown=1, NotChecked=154, Total=6320 [2022-12-13 21:11:49,466 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 348 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:11:49,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 332 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 21:11:49,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-13 21:11:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2022-12-13 21:11:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 66 states have internal predecessors, (76), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-13 21:11:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2022-12-13 21:11:49,488 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 44 [2022-12-13 21:11:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:11:49,488 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2022-12-13 21:11:49,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 42 states have internal predecessors, (69), 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-12-13 21:11:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2022-12-13 21:11:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 21:11:49,489 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:11:49,489 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:49,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 21:11:49,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:11:49,691 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:11:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2042609176, now seen corresponding path program 3 times [2022-12-13 21:11:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:49,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503356163] [2022-12-13 21:11:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:11:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:11:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:49,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:11:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:49,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 21:11:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-13 21:11:49,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:49,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503356163] [2022-12-13 21:11:49,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503356163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:11:49,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504488350] [2022-12-13 21:11:49,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 21:11:49,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:11:49,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:11:49,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:11:49,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 21:11:50,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 21:11:50,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:11:50,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:11:50,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:11:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 21:11:50,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:11:50,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504488350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:50,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:11:50,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 21:11:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930632221] [2022-12-13 21:11:50,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:50,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:11:50,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:50,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:11:50,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:11:50,122 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12-13 21:11:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:11:50,145 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-12-13 21:11:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 45 [2022-12-13 21:11:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:11:50,146 INFO L225 Difference]: With dead ends: 91 [2022-12-13 21:11:50,146 INFO L226 Difference]: Without dead ends: 39 [2022-12-13 21:11:50,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 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-12-13 21:11:50,146 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:11:50,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 47 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:11:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-13 21:11:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-12-13 21:11:50,159 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-12-13 21:11:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-12-13 21:11:50,159 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 45 [2022-12-13 21:11:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:11:50,159 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-12-13 21:11:50,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12-13 21:11:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-12-13 21:11:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 21:11:50,160 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:11:50,160 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-12-13 21:11:50,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 21:11:50,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:11:50,362 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:11:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1576200124, now seen corresponding path program 2 times [2022-12-13 21:11:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:50,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741166270] [2022-12-13 21:11:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:51,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:11:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:11:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 21:11:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 21:11:51,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:51,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741166270] [2022-12-13 21:11:51,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741166270] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:11:51,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210337350] [2022-12-13 21:11:51,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:11:51,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:11:51,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:11:51,896 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:11:51,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07cbe38b-c969-4591-92b2-7bea7d811d52/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 21:11:52,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 21:11:52,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:11:52,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 185 conjunts are in the unsatisfiable core [2022-12-13 21:11:52,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:11:52,074 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-12-13 21:11:52,109 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-12-13 21:11:52,226 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 21:11:52,226 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-12-13 21:11:52,360 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-12-13 21:11:52,402 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 21:11:52,402 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-12-13 21:11:52,479 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-12-13 21:11:52,486 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-12-13 21:11:52,579 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 21:11:52,580 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 64 treesize of output 42 [2022-12-13 21:11:52,590 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 27 treesize of output 22 [2022-12-13 21:11:52,801 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-12-13 21:11:52,801 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 96 treesize of output 46 [2022-12-13 21:11:52,807 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-12-13 21:11:52,811 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-12-13 21:11:52,890 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-12-13 21:11:52,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:52,996 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 21:11:52,996 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 102 treesize of output 84 [2022-12-13 21:11:53,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:53,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:53,020 INFO L321 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2022-12-13 21:11:53,020 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-12-13 21:11:53,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:53,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:53,047 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 21:11:53,048 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-12-13 21:11:53,854 INFO L321 Elim1Store]: treesize reduction 199, result has 15.7 percent of original size [2022-12-13 21:11:53,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 234 treesize of output 126 [2022-12-13 21:11:53,893 INFO L321 Elim1Store]: treesize reduction 106, result has 15.2 percent of original size [2022-12-13 21:11:53,893 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 8 new quantified variables, introduced 10 case distinctions, treesize of input 323 treesize of output 184 [2022-12-13 21:11:53,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:53,927 INFO L321 Elim1Store]: treesize reduction 108, result has 23.9 percent of original size [2022-12-13 21:11:53,927 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 3 case distinctions, treesize of input 149 treesize of output 136 [2022-12-13 21:11:53,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:53,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:53,946 INFO L321 Elim1Store]: treesize reduction 75, result has 6.3 percent of original size [2022-12-13 21:11:53,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 144 [2022-12-13 21:11:53,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:53,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:11:53,957 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 70 treesize of output 43 [2022-12-13 21:11:53,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2022-12-13 21:11:55,104 INFO L321 Elim1Store]: treesize reduction 137, result has 12.2 percent of original size [2022-12-13 21:11:55,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 325 treesize of output 135 [2022-12-13 21:11:55,128 INFO L321 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2022-12-13 21:11:55,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 85 [2022-12-13 21:11:55,328 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-12-13 21:11:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:11:55,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:12:02,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:12:02,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3021 treesize of output 2998 [2022-12-13 21:12:02,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:12:02,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32924 treesize of output 32040 [2022-12-13 21:12:02,292 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 33829 treesize of output 30269 [2022-12-13 21:12:02,329 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 32061 treesize of output 30281 [2022-12-13 21:12:03,377 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 448 treesize of output 3 [2022-12-13 21:12:03,391 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 448 treesize of output 3 [2022-12-13 21:12:05,271 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 448 treesize of output 3 [2022-12-13 21:12:05,302 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 448 treesize of output 3 [2022-12-13 21:12:05,445 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 448 treesize of output 3 [2022-12-13 21:12:05,501 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 448 treesize of output 3 [2022-12-13 21:12:05,546 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 448 treesize of output 3