./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/res1.c --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_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/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_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/res1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/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_f5bbe854-77b8-440c-a902-a46fb8e107a2/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 f274a5aba9f5a53aba1b5bf0fd0b9cf2990c13e825cbbe6f7043cc6fa5a18df6 --- 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 18:04:39,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:04:39,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:04:39,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:04:39,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:04:39,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:04:40,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:04:40,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:04:40,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:04:40,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:04:40,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:04:40,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:04:40,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:04:40,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:04:40,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:04:40,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:04:40,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:04:40,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:04:40,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:04:40,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:04:40,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:04:40,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:04:40,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:04:40,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:04:40,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:04:40,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:04:40,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:04:40,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:04:40,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:04:40,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:04:40,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:04:40,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:04:40,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:04:40,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:04:40,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:04:40,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:04:40,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:04:40,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:04:40,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:04:40,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:04:40,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:04:40,029 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 18:04:40,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:04:40,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:04:40,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:04:40,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:04:40,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:04:40,050 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:04:40,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:04:40,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:04:40,061 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:04:40,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:04:40,062 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:04:40,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:04:40,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:04:40,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:04:40,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:04:40,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:04:40,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:04:40,063 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:04:40,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:04:40,063 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:04:40,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:04:40,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:04:40,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:04:40,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:04:40,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:04:40,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:04:40,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:04:40,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:04:40,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:04:40,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:04:40,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:04:40,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:04:40,066 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:04:40,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:04:40,066 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:04:40,067 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_f5bbe854-77b8-440c-a902-a46fb8e107a2/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_f5bbe854-77b8-440c-a902-a46fb8e107a2/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 -> f274a5aba9f5a53aba1b5bf0fd0b9cf2990c13e825cbbe6f7043cc6fa5a18df6 [2022-12-13 18:04:40,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:04:40,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:04:40,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:04:40,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:04:40,269 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:04:40,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-fpi/res1.c [2022-12-13 18:04:42,842 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:04:43,005 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:04:43,006 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/sv-benchmarks/c/array-fpi/res1.c [2022-12-13 18:04:43,011 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/data/3c8a5b6d3/549067a34c814a758b9b539c3344b43f/FLAGda8affed1 [2022-12-13 18:04:43,415 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/data/3c8a5b6d3/549067a34c814a758b9b539c3344b43f [2022-12-13 18:04:43,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:04:43,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:04:43,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:04:43,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:04:43,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:04:43,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fec904b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43, skipping insertion in model container [2022-12-13 18:04:43,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:04:43,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:04:43,540 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_f5bbe854-77b8-440c-a902-a46fb8e107a2/sv-benchmarks/c/array-fpi/res1.c[587,600] [2022-12-13 18:04:43,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:04:43,561 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:04:43,570 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_f5bbe854-77b8-440c-a902-a46fb8e107a2/sv-benchmarks/c/array-fpi/res1.c[587,600] [2022-12-13 18:04:43,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:04:43,585 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:04:43,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43 WrapperNode [2022-12-13 18:04:43,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:04:43,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:04:43,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:04:43,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:04:43,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,611 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-12-13 18:04:43,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:04:43,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:04:43,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:04:43,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:04:43,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,628 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:04:43,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:04:43,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:04:43,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:04:43,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (1/1) ... [2022-12-13 18:04:43,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:04:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:04:43,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:04:43,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:04:43,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:04:43,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:04:43,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:04:43,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:04:43,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 18:04:43,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:04:43,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:04:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:04:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:04:43,743 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:04:43,745 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:04:43,859 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:04:43,864 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:04:43,864 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 18:04:43,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:04:43 BoogieIcfgContainer [2022-12-13 18:04:43,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:04:43,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:04:43,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:04:43,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:04:43,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:04:43" (1/3) ... [2022-12-13 18:04:43,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f41eab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:04:43, skipping insertion in model container [2022-12-13 18:04:43,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:04:43" (2/3) ... [2022-12-13 18:04:43,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f41eab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:04:43, skipping insertion in model container [2022-12-13 18:04:43,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:04:43" (3/3) ... [2022-12-13 18:04:43,875 INFO L112 eAbstractionObserver]: Analyzing ICFG res1.c [2022-12-13 18:04:43,894 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:04:43,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 18:04:43,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:04:43,940 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;@2103eda6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:04:43,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 18:04:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 18:04:43,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:04:43,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:04:43,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:04:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:04:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1202110748, now seen corresponding path program 1 times [2022-12-13 18:04:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:04:43,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757507219] [2022-12-13 18:04:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:04:43,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:04:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:04:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:04:44,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757507219] [2022-12-13 18:04:44,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757507219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:04:44,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:04:44,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:04:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811633535] [2022-12-13 18:04:44,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:04:44,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 18:04:44,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:04:44,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:04:44,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:04:44,134 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:04:44,146 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-12-13 18:04:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:04:44,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 18:04:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:04:44,154 INFO L225 Difference]: With dead ends: 44 [2022-12-13 18:04:44,154 INFO L226 Difference]: Without dead ends: 20 [2022-12-13 18:04:44,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:04:44,159 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:04:44,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:04:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-13 18:04:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-12-13 18:04:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-12-13 18:04:44,182 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2022-12-13 18:04:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:04:44,182 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-12-13 18:04:44,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-12-13 18:04:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 18:04:44,183 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:04:44,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:04:44,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:04:44,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:04:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:04:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash -944124056, now seen corresponding path program 1 times [2022-12-13 18:04:44,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:04:44,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831791595] [2022-12-13 18:04:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:04:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:04:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:04:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:04:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831791595] [2022-12-13 18:04:44,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831791595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:04:44,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:04:44,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:04:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434448468] [2022-12-13 18:04:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:04:44,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:04:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:04:44,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:04:44,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:04:44,324 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:04:44,377 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-12-13 18:04:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:04:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 18:04:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:04:44,378 INFO L225 Difference]: With dead ends: 41 [2022-12-13 18:04:44,378 INFO L226 Difference]: Without dead ends: 28 [2022-12-13 18:04:44,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:04:44,379 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:04:44,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:04:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-13 18:04:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-12-13 18:04:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-12-13 18:04:44,384 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2022-12-13 18:04:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:04:44,384 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-12-13 18:04:44,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-12-13 18:04:44,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 18:04:44,385 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:04:44,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:04:44,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:04:44,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:04:44,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:04:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1401448688, now seen corresponding path program 1 times [2022-12-13 18:04:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:04:44,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729020623] [2022-12-13 18:04:44,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:04:44,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:04:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:04:45,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:04:45,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729020623] [2022-12-13 18:04:45,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729020623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:04:45,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530405562] [2022-12-13 18:04:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:04:45,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:04:45,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:04:45,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:04:45,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 18:04:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:45,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 18:04:45,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:04:45,563 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 10 treesize of output 8 [2022-12-13 18:04:45,577 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 18:04:45,645 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 18:04:45,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:45,818 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 18:04:45,819 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 26 treesize of output 28 [2022-12-13 18:04:45,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:45,993 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 18:04:45,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-12-13 18:04:46,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:46,203 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 18:04:46,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 36 [2022-12-13 18:04:46,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:46,359 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 18:04:46,359 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 35 treesize of output 15 [2022-12-13 18:04:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:04:46,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:04:46,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:04:46,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:04:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:04:46,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530405562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:04:46,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:04:46,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-12-13 18:04:46,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183648180] [2022-12-13 18:04:46,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:04:46,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 18:04:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:04:46,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 18:04:46,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-12-13 18:04:46,927 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:04:47,851 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-12-13 18:04:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 18:04:47,851 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 18:04:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:04:47,852 INFO L225 Difference]: With dead ends: 36 [2022-12-13 18:04:47,852 INFO L226 Difference]: Without dead ends: 32 [2022-12-13 18:04:47,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=396, Invalid=1496, Unknown=0, NotChecked=0, Total=1892 [2022-12-13 18:04:47,853 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 77 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:04:47,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 66 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:04:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-13 18:04:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-12-13 18:04:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-12-13 18:04:47,858 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2022-12-13 18:04:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:04:47,858 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-12-13 18:04:47,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-12-13 18:04:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 18:04:47,859 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:04:47,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:04:47,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:04:48,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 18:04:48,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:04:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:04:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1774307726, now seen corresponding path program 2 times [2022-12-13 18:04:48,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:04:48,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439053379] [2022-12-13 18:04:48,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:04:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:04:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 18:04:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:04:48,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439053379] [2022-12-13 18:04:48,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439053379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:04:48,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421900568] [2022-12-13 18:04:48,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:04:48,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:04:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:04:48,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:04:48,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 18:04:48,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:04:48,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:04:48,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:04:48,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:04:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 18:04:48,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:04:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 18:04:48,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421900568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:04:48,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:04:48,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 18:04:48,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583176842] [2022-12-13 18:04:48,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:04:48,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 18:04:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:04:48,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 18:04:48,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:04:48,303 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:04:48,410 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-12-13 18:04:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:04:48,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-13 18:04:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:04:48,411 INFO L225 Difference]: With dead ends: 73 [2022-12-13 18:04:48,412 INFO L226 Difference]: Without dead ends: 40 [2022-12-13 18:04:48,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-12-13 18:04:48,413 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:04:48,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 35 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:04:48,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-13 18:04:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2022-12-13 18:04:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-12-13 18:04:48,420 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-12-13 18:04:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:04:48,420 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-12-13 18:04:48,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-12-13 18:04:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 18:04:48,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:04:48,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:04:48,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 18:04:48,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:04:48,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:04:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:04:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1796008330, now seen corresponding path program 3 times [2022-12-13 18:04:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:04:48,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70164580] [2022-12-13 18:04:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:04:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:04:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 18:04:48,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:04:48,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70164580] [2022-12-13 18:04:48,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70164580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:04:48,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211733517] [2022-12-13 18:04:48,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:04:48,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:04:48,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:04:48,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:04:48,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 18:04:48,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 18:04:48,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:04:48,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:04:48,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:04:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 18:04:48,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:04:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 18:04:48,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211733517] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:04:48,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:04:48,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 18:04:48,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759516568] [2022-12-13 18:04:48,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:04:48,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 18:04:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:04:48,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 18:04:48,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:04:48,944 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:04:49,025 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-12-13 18:04:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:04:49,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 18:04:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:04:49,025 INFO L225 Difference]: With dead ends: 39 [2022-12-13 18:04:49,026 INFO L226 Difference]: Without dead ends: 35 [2022-12-13 18:04:49,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 18:04:49,027 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:04:49,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 22 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:04:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-13 18:04:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-12-13 18:04:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-12-13 18:04:49,034 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2022-12-13 18:04:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:04:49,034 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-12-13 18:04:49,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:04:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-12-13 18:04:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 18:04:49,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:04:49,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:04:49,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 18:04:49,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:04:49,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:04:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:04:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 666081912, now seen corresponding path program 4 times [2022-12-13 18:04:49,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:04:49,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616415699] [2022-12-13 18:04:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:04:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:04:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:04:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:04:50,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:04:50,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616415699] [2022-12-13 18:04:50,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616415699] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:04:50,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780931149] [2022-12-13 18:04:50,998 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:04:50,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:04:50,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:04:50,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:04:51,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 18:04:51,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:04:51,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:04:51,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-13 18:04:51,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:04:51,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:04:51,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:51,097 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 18:04:51,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-12-13 18:04:51,154 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 23 treesize of output 22 [2022-12-13 18:04:51,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:51,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2022-12-13 18:04:51,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:51,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:51,553 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 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 18:04:51,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:51,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:51,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:51,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-13 18:04:52,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:52,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:04:52,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:52,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:52,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-12-13 18:04:52,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:52,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:52,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-12-13 18:04:52,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:52,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:52,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:04:52,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2022-12-13 18:04:52,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:52,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2022-12-13 18:04:52,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:04:52,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-12-13 18:04:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:04:52,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:05:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:05:02,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780931149] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:05:02,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:05:02,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 64 [2022-12-13 18:05:02,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124227818] [2022-12-13 18:05:02,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:05:02,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-13 18:05:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:05:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-13 18:05:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3415, Unknown=1, NotChecked=0, Total=4032 [2022-12-13 18:05:02,490 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 64 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:05:16,589 WARN L233 SmtUtils]: Spent 12.55s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:05:33,807 WARN L233 SmtUtils]: Spent 15.14s on a formula simplification that was a NOOP. DAG size: 297 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:05:35,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:05:54,042 WARN L233 SmtUtils]: Spent 17.02s on a formula simplification that was a NOOP. DAG size: 223 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:06:01,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:06:03,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:06:12,912 WARN L233 SmtUtils]: Spent 7.67s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:06:14,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:06:19,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:06:23,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:06:25,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:06:27,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:06:34,633 WARN L233 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:07:01,429 WARN L233 SmtUtils]: Spent 22.74s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:07:12,304 WARN L233 SmtUtils]: Spent 10.55s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:07:21,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:07:23,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:07:26,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:07:46,671 WARN L233 SmtUtils]: Spent 19.30s on a formula simplification. DAG size of input: 297 DAG size of output: 249 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:07:48,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:07:51,018 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, 1] [2022-12-13 18:07:53,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:07:55,620 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, 1] [2022-12-13 18:07:58,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:08:12,151 WARN L233 SmtUtils]: Spent 10.26s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:09:10,518 WARN L233 SmtUtils]: Spent 54.83s on a formula simplification. DAG size of input: 272 DAG size of output: 270 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:09:12,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:09:14,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:09:16,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:09:18,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:09:26,735 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, 1] [2022-12-13 18:09:55,378 WARN L233 SmtUtils]: Spent 25.69s on a formula simplification that was a NOOP. DAG size: 281 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:10:17,245 WARN L233 SmtUtils]: Spent 20.80s on a formula simplification that was a NOOP. DAG size: 283 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:10:27,567 WARN L233 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:10:34,474 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:10:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:10:34,502 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-12-13 18:10:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-13 18:10:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-13 18:10:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:10:34,504 INFO L225 Difference]: With dead ends: 85 [2022-12-13 18:10:34,504 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 18:10:34,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4084 ImplicationChecksByTransitivity, 293.7s TimeCoverageRelationStatistics Valid=1992, Invalid=10883, Unknown=7, NotChecked=0, Total=12882 [2022-12-13 18:10:34,507 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 165 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:10:34,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 876 Invalid, 19 Unknown, 0 Unchecked, 48.8s Time] [2022-12-13 18:10:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 18:10:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2022-12-13 18:10:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:10:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-12-13 18:10:34,530 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 31 [2022-12-13 18:10:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:10:34,531 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-12-13 18:10:34,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:10:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-12-13 18:10:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 18:10:34,531 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:10:34,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:10:34,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 18:10:34,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 18:10:34,733 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:10:34,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:10:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash 207824378, now seen corresponding path program 5 times [2022-12-13 18:10:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:10:34,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604397123] [2022-12-13 18:10:34,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:10:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:10:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:10:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 18:10:34,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:10:34,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604397123] [2022-12-13 18:10:34,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604397123] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:10:34,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932522281] [2022-12-13 18:10:34,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 18:10:34,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:10:34,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:10:34,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:10:34,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 18:10:34,953 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 18:10:34,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:10:34,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 18:10:34,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:10:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 18:10:35,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:10:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 18:10:35,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932522281] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:10:35,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:10:35,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 18:10:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346018994] [2022-12-13 18:10:35,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:10:35,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 18:10:35,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:10:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 18:10:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:10:35,105 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:10:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:10:35,360 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-12-13 18:10:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:10:35,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-13 18:10:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:10:35,362 INFO L225 Difference]: With dead ends: 118 [2022-12-13 18:10:35,362 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 18:10:35,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-12-13 18:10:35,363 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 69 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:10:35,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 39 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:10:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 18:10:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-12-13 18:10:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:10:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-12-13 18:10:35,381 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 33 [2022-12-13 18:10:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:10:35,381 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-12-13 18:10:35,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:10:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-12-13 18:10:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 18:10:35,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:10:35,382 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] [2022-12-13 18:10:35,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 18:10:35,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:10:35,583 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:10:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:10:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash 236928956, now seen corresponding path program 6 times [2022-12-13 18:10:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:10:35,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596064564] [2022-12-13 18:10:35,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:10:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:10:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:10:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 18:10:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:10:35,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596064564] [2022-12-13 18:10:35,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596064564] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:10:35,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255677444] [2022-12-13 18:10:35,682 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 18:10:35,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:10:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:10:35,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:10:35,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 18:10:35,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 18:10:35,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:10:35,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 18:10:35,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:10:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 18:10:35,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:10:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 18:10:35,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255677444] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:10:35,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:10:35,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 18:10:35,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033319198] [2022-12-13 18:10:35,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:10:35,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 18:10:35,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:10:35,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 18:10:35,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:10:35,908 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:10:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:10:36,072 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-12-13 18:10:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 18:10:36,073 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-13 18:10:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:10:36,073 INFO L225 Difference]: With dead ends: 71 [2022-12-13 18:10:36,073 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 18:10:36,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-12-13 18:10:36,074 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:10:36,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 19 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:10:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 18:10:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-12-13 18:10:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:10:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-12-13 18:10:36,083 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 35 [2022-12-13 18:10:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:10:36,084 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-12-13 18:10:36,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:10:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-12-13 18:10:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 18:10:36,084 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:10:36,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:10:36,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 18:10:36,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:10:36,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:10:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:10:36,287 INFO L85 PathProgramCache]: Analyzing trace with hash 315843584, now seen corresponding path program 7 times [2022-12-13 18:10:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:10:36,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169303045] [2022-12-13 18:10:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:10:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:10:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:10:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:10:39,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:10:39,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169303045] [2022-12-13 18:10:39,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169303045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:10:39,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359060709] [2022-12-13 18:10:39,239 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 18:10:39,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:10:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:10:39,240 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:10:39,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5bbe854-77b8-440c-a902-a46fb8e107a2/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 18:10:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:10:39,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-13 18:10:39,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:10:39,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:10:39,435 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 18:10:39,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-12-13 18:10:39,521 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 23 treesize of output 22 [2022-12-13 18:10:39,700 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 35 treesize of output 37 [2022-12-13 18:10:39,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:39,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:39,903 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 37 treesize of output 42 [2022-12-13 18:10:40,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:40,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:40,189 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:10:40,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:40,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:40,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 71 [2022-12-13 18:10:40,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:40,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:40,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:40,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:40,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2022-12-13 18:10:41,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:10:41,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 88 [2022-12-13 18:10:41,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:10:41,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2022-12-13 18:10:41,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:41,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2022-12-13 18:10:42,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:42,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:42,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:42,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:10:42,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2022-12-13 18:10:42,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:42,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:42,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:42,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:10:42,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:10:42,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2022-12-13 18:10:43,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 81 [2022-12-13 18:10:43,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 31 [2022-12-13 18:10:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:10:43,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:13:55,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:13:55,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:13:55,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 18:13:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:13:55,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359060709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:13:55,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:13:55,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 27] total 82 [2022-12-13 18:13:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066105765] [2022-12-13 18:13:55,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:13:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-12-13 18:13:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:13:55,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-12-13 18:13:55,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=5973, Unknown=56, NotChecked=0, Total=6642 [2022-12-13 18:13:55,897 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 82 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:30,452 WARN L233 SmtUtils]: Spent 23.06s on a formula simplification. DAG size of input: 221 DAG size of output: 192 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:14:32,824 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, 1] [2022-12-13 18:14:34,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:14:36,905 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, 1] [2022-12-13 18:14:39,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:14:41,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:14:43,562 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, 1] [2022-12-13 18:14:45,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:14:47,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:15:01,402 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse25 (* c_~N~0 2)) (.cse42 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (.cse31 (<= (mod c_~N~0 4294967296) 536870911)) (.cse23 (+ .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse29 (+ .cse42 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse30 (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse17 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse16 (+ .cse25 1)) (.cse19 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (+ .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse15 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (select .cse8 4)) (.cse6 (select .cse8 0)) (.cse3 (select .cse7 8)) (.cse1 (select .cse8 8)) (.cse4 (select .cse7 0)) (.cse5 (select .cse7 4))) (and (<= .cse0 (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) (<= .cse2 1) (<= .cse6 1) (<= .cse3 1) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse1 1) (<= .cse4 1) (<= .cse5 1) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (select .cse12 8)) (.cse10 (select .cse12 0)) (.cse11 (select .cse12 4))) (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= .cse9 1) (<= .cse10 1) (<= .cse0 (+ .cse9 .cse10 .cse11)) (<= .cse11 1) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) (< 2 c_~N~0) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse13 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse21 .cse22 v_ArrVal_437) .cse23 v_ArrVal_438)))) (store .cse20 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse18 v_ArrVal_443) .cse15 v_ArrVal_445))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_455 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse15)) .cse16) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))) (not (<= v_ArrVal_437 1)))))) .cse24) (<= (+ .cse0 3) .cse25) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse26 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse21 .cse23 v_ArrVal_437) .cse29 v_ArrVal_438)))) (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse18 v_ArrVal_443) .cse15 v_ArrVal_445))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_447 (+ (select (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18)))) (not (<= v_ArrVal_437 1)) (< (+ v_ArrVal_455 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse15)) .cse16))))) .cse30) .cse31 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse32 4) 1) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse33 (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 .cse23 v_ArrVal_438)))) (store .cse35 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse18 v_ArrVal_443) .cse15 v_ArrVal_445))))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (< (+ v_ArrVal_455 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse15)) .cse16) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)))) (not (<= v_ArrVal_447 (+ (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse24) (= (select .cse32 8) 1) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse31) (and (not .cse31) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= (select .cse32 0) 1) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int) (v_ArrVal_435 Int)) (let ((.cse36 (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse21 .cse22 v_ArrVal_435) .cse23 v_ArrVal_437) .cse29 v_ArrVal_438)))) (store .cse38 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse18 v_ArrVal_443) .cse15 v_ArrVal_445))))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_435 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))) (< (+ v_ArrVal_455 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse15)) .cse16) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18)))) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)))) (not (<= v_ArrVal_437 1)))))) .cse30) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse39 (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 .cse22 v_ArrVal_438)))) (store .cse41 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse18 v_ArrVal_443) .cse15 v_ArrVal_445))))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse18)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse17)))) (not (<= v_ArrVal_440 1)) (< (+ v_ArrVal_455 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse15)) .cse16) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))) (not (<= v_ArrVal_447 (+ (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (<= (select .cse32 .cse18) 1) (<= (select .cse32 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (select .cse32 .cse15) 1)))) is different from true [2022-12-13 18:15:28,194 WARN L233 SmtUtils]: Spent 23.44s on a formula simplification. DAG size of input: 199 DAG size of output: 194 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:15:30,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:15:32,794 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, 1] [2022-12-13 18:15:35,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:17:33,576 WARN L233 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 327 DAG size of output: 321 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:18:51,294 WARN L233 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 354 DAG size of output: 349 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:18:53,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:18:56,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:18:58,666 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, 1] [2022-12-13 18:19:06,161 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse34 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse19 (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (.cse18 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse23 (+ .cse34 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse11 (+ (* c_~N~0 2) 1)) (.cse14 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse1 (select .cse7 4)) (.cse5 (select .cse7 0)) (.cse2 (select .cse6 8)) (.cse0 (select .cse7 8)) (.cse3 (select .cse6 0)) (.cse4 (select .cse6 4))) (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (<= .cse1 1) (<= .cse5 1) (<= .cse2 1) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse0 1) (<= .cse3 1) (<= .cse4 1) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) (< 2 c_~N~0) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse8 (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_437) .cse18 v_ArrVal_438)))) (store .cse15 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_455 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (not (<= v_ArrVal_437 1)))))) .cse19) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse20 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse18 v_ArrVal_437) .cse23 v_ArrVal_438)))) (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_447 (+ (select (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_437 1)) (< (+ v_ArrVal_455 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11))))) .cse24) (<= (mod c_~N~0 4294967296) 536870911) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse25 (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse16 .cse18 v_ArrVal_438)))) (store .cse27 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse27 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (< (+ v_ArrVal_455 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_447 (+ (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse19) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int) (v_ArrVal_435 Int)) (let ((.cse28 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse16 .cse17 v_ArrVal_435) .cse18 v_ArrVal_437) .cse23 v_ArrVal_438)))) (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_435 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (< (+ v_ArrVal_455 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_437 1)))))) .cse24) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse31 (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse16 .cse17 v_ArrVal_438)))) (store .cse33 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_440 1)) (< (+ v_ArrVal_455 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (not (<= v_ArrVal_447 (+ (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) is different from true [2022-12-13 18:19:09,286 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse26 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse11 (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (.cse10 (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse15 (+ .cse26 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ (* c_~N~0 2) 1)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse0 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse8 .cse9 v_ArrVal_437) .cse10 v_ArrVal_438)))) (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse5 v_ArrVal_443) .cse2 v_ArrVal_445))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_455 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) .cse3) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (not (<= v_ArrVal_437 1)))))) .cse11) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse12 (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse8 .cse10 v_ArrVal_437) .cse15 v_ArrVal_438)))) (store .cse14 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse5 v_ArrVal_443) .cse2 v_ArrVal_445))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_447 (+ (select (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)))) (not (<= v_ArrVal_437 1)) (< (+ v_ArrVal_455 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) .cse3))))) .cse16) (<= (mod c_~N~0 4294967296) 536870911) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse17 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 .cse10 v_ArrVal_438)))) (store .cse19 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse5 v_ArrVal_443) .cse2 v_ArrVal_445))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (< (+ v_ArrVal_455 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) .cse3) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (<= v_ArrVal_447 (+ (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse11) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int) (v_ArrVal_435 Int)) (let ((.cse20 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse8 .cse9 v_ArrVal_435) .cse10 v_ArrVal_437) .cse15 v_ArrVal_438)))) (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse5 v_ArrVal_443) .cse2 v_ArrVal_445))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_435 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (< (+ v_ArrVal_455 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) .cse3) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)))) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (<= v_ArrVal_437 1)))))) .cse16) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse23 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 .cse9 v_ArrVal_438)))) (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse5 v_ArrVal_443) .cse2 v_ArrVal_445))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (not (<= v_ArrVal_440 1)) (< (+ v_ArrVal_455 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse2)) .cse3) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (not (<= v_ArrVal_447 (+ (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) is different from false [2022-12-13 18:19:13,709 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse35 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse19 (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (.cse25 (<= (mod c_~N~0 4294967296) 536870911)) (.cse18 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse23 (+ .cse35 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse11 (+ (* c_~N~0 2) 1)) (.cse14 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse1 (select .cse7 4)) (.cse5 (select .cse7 0)) (.cse2 (select .cse6 8)) (.cse0 (select .cse7 8)) (.cse3 (select .cse6 0)) (.cse4 (select .cse6 4))) (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (<= .cse1 1) (<= .cse5 1) (<= .cse2 1) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse0 1) (<= .cse3 1) (<= .cse4 1) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) (< 2 c_~N~0) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse8 (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse17 v_ArrVal_437) .cse18 v_ArrVal_438)))) (store .cse15 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_455 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (not (<= v_ArrVal_437 1)))))) .cse19) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse20 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse16 .cse18 v_ArrVal_437) .cse23 v_ArrVal_438)))) (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_447 (+ (select (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_437 1)) (< (+ v_ArrVal_455 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11))))) .cse24) .cse25 (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse26 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse16 .cse18 v_ArrVal_438)))) (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (< (+ v_ArrVal_455 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_447 (+ (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse19) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse25) (and (not .cse25) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_437 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int) (v_ArrVal_435 Int)) (let ((.cse29 (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse16 .cse17 v_ArrVal_435) .cse18 v_ArrVal_437) .cse23 v_ArrVal_438)))) (store .cse31 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse31 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_435 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (< (+ v_ArrVal_455 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_437 1)))))) .cse24) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_445 Int) (v_ArrVal_455 Int) (v_ArrVal_443 Int) (v_ArrVal_452 Int) (v_ArrVal_440 Int) (v_ArrVal_450 Int) (v_ArrVal_438 Int) (v_ArrVal_448 Int) (v_ArrVal_447 Int)) (let ((.cse32 (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse16 .cse17 v_ArrVal_438)))) (store .cse34 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse34 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse13 v_ArrVal_443) .cse10 v_ArrVal_445))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_450)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse13)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)))) (not (<= v_ArrVal_440 1)) (< (+ v_ArrVal_455 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse10)) .cse11) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (not (<= v_ArrVal_447 (+ (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) is different from true [2022-12-13 18:19:15,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:17,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:19,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:21,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:23,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:25,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:27,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:29,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:32,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:34,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:36,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:38,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:40,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:42,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:44,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:46,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:19:48,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]