./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 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/res1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS --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-4e7fbc6 [2022-11-23 03:11:04,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:11:04,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:11:04,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:11:04,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:11:04,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:11:04,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:11:04,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:11:04,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:11:04,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:11:04,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:11:04,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:11:04,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:11:04,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:11:04,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:11:04,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:11:04,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:11:04,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:11:04,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:11:04,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:11:04,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:11:04,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:11:04,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:11:04,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:11:04,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:11:04,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:11:04,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:11:04,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:11:04,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:11:04,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:11:04,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:11:04,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:11:04,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:11:04,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:11:04,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:11:04,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:11:04,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:11:04,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:11:04,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:11:04,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:11:04,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:11:04,115 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:11:04,138 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:11:04,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:11:04,139 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:11:04,139 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:11:04,140 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:11:04,141 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:11:04,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:11:04,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:11:04,142 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:11:04,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:11:04,143 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:11:04,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:11:04,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:11:04,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:11:04,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:11:04,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:11:04,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:11:04,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:11:04,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:11:04,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:11:04,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:11:04,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:11:04,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:11:04,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:11:04,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:11:04,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:11:04,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:11:04,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:11:04,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:11:04,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:11:04,148 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:11:04,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:11:04,149 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:11:04,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:11:04,149 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_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/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_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS 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-11-23 03:11:04,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:11:04,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:11:04,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:11:04,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:11:04,466 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:11:04,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/array-fpi/res1.c [2022-11-23 03:11:07,638 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:11:07,937 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:11:07,938 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/sv-benchmarks/c/array-fpi/res1.c [2022-11-23 03:11:07,949 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/data/de2227622/8f48b4168a974fd99b10214a8a35ab74/FLAG2c2abdbd9 [2022-11-23 03:11:07,975 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/data/de2227622/8f48b4168a974fd99b10214a8a35ab74 [2022-11-23 03:11:07,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:11:07,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:11:07,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:11:07,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:11:07,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:11:07,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:11:07" (1/1) ... [2022-11-23 03:11:07,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f96fef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:07, skipping insertion in model container [2022-11-23 03:11:07,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:11:07" (1/1) ... [2022-11-23 03:11:08,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:11:08,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:11:08,193 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_2a69210b-6b86-464f-8a2a-52cc66c90848/sv-benchmarks/c/array-fpi/res1.c[587,600] [2022-11-23 03:11:08,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:11:08,241 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:11:08,257 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_2a69210b-6b86-464f-8a2a-52cc66c90848/sv-benchmarks/c/array-fpi/res1.c[587,600] [2022-11-23 03:11:08,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:11:08,287 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:11:08,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08 WrapperNode [2022-11-23 03:11:08,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:11:08,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:11:08,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:11:08,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:11:08,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,333 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-11-23 03:11:08,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:11:08,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:11:08,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:11:08,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:11:08,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,394 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:11:08,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:11:08,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:11:08,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:11:08,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (1/1) ... [2022-11-23 03:11:08,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:11:08,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:11:08,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:11:08,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:11:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:11:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:11:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:11:08,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:11:08,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 03:11:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:11:08,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:11:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:11:08,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:11:08,600 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:11:08,602 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:11:08,782 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:11:08,789 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:11:08,789 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 03:11:08,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:08 BoogieIcfgContainer [2022-11-23 03:11:08,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:11:08,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:11:08,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:11:08,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:11:08,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:11:07" (1/3) ... [2022-11-23 03:11:08,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f143430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:11:08, skipping insertion in model container [2022-11-23 03:11:08,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:08" (2/3) ... [2022-11-23 03:11:08,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f143430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:11:08, skipping insertion in model container [2022-11-23 03:11:08,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:08" (3/3) ... [2022-11-23 03:11:08,802 INFO L112 eAbstractionObserver]: Analyzing ICFG res1.c [2022-11-23 03:11:08,828 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:11:08,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:11:08,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:11:08,954 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;@439c521e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:11:08,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 03:11:08,959 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-11-23 03:11:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 03:11:08,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:11:08,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:11:08,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:11:08,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:11:08,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1202110748, now seen corresponding path program 1 times [2022-11-23 03:11:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:11:08,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126643451] [2022-11-23 03:11:08,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:11:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:11:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:11:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:11:09,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:11:09,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126643451] [2022-11-23 03:11:09,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126643451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:11:09,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:11:09,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:11:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102637877] [2022-11-23 03:11:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:11:09,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:11:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:11:09,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:11:09,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:11:09,263 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-11-23 03:11:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:11:09,282 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-11-23 03:11:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:11:09,285 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-11-23 03:11:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:11:09,293 INFO L225 Difference]: With dead ends: 44 [2022-11-23 03:11:09,294 INFO L226 Difference]: Without dead ends: 20 [2022-11-23 03:11:09,297 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-11-23 03:11:09,300 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-11-23 03:11:09,302 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-11-23 03:11:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-23 03:11:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-23 03:11:09,333 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-11-23 03:11:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-23 03:11:09,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2022-11-23 03:11:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:11:09,337 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-23 03:11:09,337 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-11-23 03:11:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-23 03:11:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 03:11:09,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:11:09,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:11:09,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:11:09,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:11:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:11:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash -944124056, now seen corresponding path program 1 times [2022-11-23 03:11:09,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:11:09,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069080596] [2022-11-23 03:11:09,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:11:09,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:11:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:11:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:11:09,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:11:09,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069080596] [2022-11-23 03:11:09,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069080596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:11:09,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:11:09,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:11:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104212796] [2022-11-23 03:11:09,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:11:09,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:11:09,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:11:09,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:11:09,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:11:09,552 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-11-23 03:11:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:11:09,637 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-11-23 03:11:09,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:11:09,638 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-11-23 03:11:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:11:09,639 INFO L225 Difference]: With dead ends: 41 [2022-11-23 03:11:09,639 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 03:11:09,639 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-11-23 03:11:09,641 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:11:09,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:11:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 03:11:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-11-23 03:11:09,647 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-11-23 03:11:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-23 03:11:09,649 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2022-11-23 03:11:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:11:09,649 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-23 03:11:09,650 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-11-23 03:11:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-23 03:11:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 03:11:09,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:11:09,651 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-11-23 03:11:09,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:11:09,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:11:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:11:09,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1401448688, now seen corresponding path program 1 times [2022-11-23 03:11:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:11:09,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717036657] [2022-11-23 03:11:09,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:11:09,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:11:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:11:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:11:11,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:11:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717036657] [2022-11-23 03:11:11,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717036657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:11:11,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001055682] [2022-11-23 03:11:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:11:11,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:11:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:11:11,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:11:11,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:11:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:11:11,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 03:11:11,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:11:12,067 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-11-23 03:11:12,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 03:11:12,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 03:11:12,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:12,443 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 03:11:12,444 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-11-23 03:11:12,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:12,705 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 03:11:12,705 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-11-23 03:11:13,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:13,012 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 03:11:13,012 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-11-23 03:11:13,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:13,196 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 03:11:13,197 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-11-23 03:11:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:11:13,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:11:13,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:11:13,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:11:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:11:13,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001055682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:11:13,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:11:13,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-11-23 03:11:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362275196] [2022-11-23 03:11:13,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:11:13,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 03:11:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:11:13,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 03:11:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-11-23 03:11:13,917 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-11-23 03:11:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:11:15,346 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-11-23 03:11:15,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:11:15,347 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-11-23 03:11:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:11:15,348 INFO L225 Difference]: With dead ends: 36 [2022-11-23 03:11:15,348 INFO L226 Difference]: Without dead ends: 32 [2022-11-23 03:11:15,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=396, Invalid=1496, Unknown=0, NotChecked=0, Total=1892 [2022-11-23 03:11:15,350 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 122 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:11:15,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 66 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:11:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-23 03:11:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-11-23 03:11:15,369 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-11-23 03:11:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-11-23 03:11:15,372 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2022-11-23 03:11:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:11:15,374 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-23 03:11:15,374 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-11-23 03:11:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-11-23 03:11:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 03:11:15,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:11:15,376 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-11-23 03:11:15,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 03:11:15,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-23 03:11:15,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:11:15,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:11:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1774307726, now seen corresponding path program 2 times [2022-11-23 03:11:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:11:15,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75261815] [2022-11-23 03:11:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:11:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:11:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:11:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 03:11:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:11:15,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75261815] [2022-11-23 03:11:15,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75261815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:11:15,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731774655] [2022-11-23 03:11:15,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:11:15,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:11:15,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:11:15,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:11:15,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:11:15,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:11:15,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:11:15,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:11:15,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:11:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 03:11:15,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:11:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 03:11:15,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731774655] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:11:15,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:11:15,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-23 03:11:15,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147831709] [2022-11-23 03:11:15,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:11:15,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 03:11:15,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:11:15,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 03:11:15,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:11:15,959 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-11-23 03:11:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:11:16,137 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-11-23 03:11:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:11:16,138 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-11-23 03:11:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:11:16,139 INFO L225 Difference]: With dead ends: 73 [2022-11-23 03:11:16,139 INFO L226 Difference]: Without dead ends: 40 [2022-11-23 03:11:16,139 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-11-23 03:11:16,140 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 46 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:11:16,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 35 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:11:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-23 03:11:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2022-11-23 03:11:16,149 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-11-23 03:11:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-23 03:11:16,150 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-11-23 03:11:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:11:16,150 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-23 03:11:16,150 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-11-23 03:11:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-23 03:11:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 03:11:16,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:11:16,152 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-11-23 03:11:16,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:11:16,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:11:16,357 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:11:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:11:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1796008330, now seen corresponding path program 3 times [2022-11-23 03:11:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:11:16,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567661146] [2022-11-23 03:11:16,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:11:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:11:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:11:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 03:11:16,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:11:16,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567661146] [2022-11-23 03:11:16,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567661146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:11:16,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256496754] [2022-11-23 03:11:16,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:11:16,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:11:16,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:11:16,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:11:16,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:11:16,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 03:11:16,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:11:16,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:11:16,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:11:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 03:11:16,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:11:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 03:11:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256496754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:11:16,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:11:16,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-23 03:11:16,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931677388] [2022-11-23 03:11:16,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:11:16,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 03:11:16,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:11:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 03:11:16,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:11:16,717 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-11-23 03:11:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:11:16,873 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-11-23 03:11:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:11:16,873 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-11-23 03:11:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:11:16,874 INFO L225 Difference]: With dead ends: 39 [2022-11-23 03:11:16,874 INFO L226 Difference]: Without dead ends: 35 [2022-11-23 03:11:16,875 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-11-23 03:11:16,876 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:11:16,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 22 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:11:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-23 03:11:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-11-23 03:11:16,884 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-11-23 03:11:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-23 03:11:16,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2022-11-23 03:11:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:11:16,886 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-23 03:11:16,886 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-11-23 03:11:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-23 03:11:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 03:11:16,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:11:16,887 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-11-23 03:11:16,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:11:17,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:11:17,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:11:17,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:11:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash 666081912, now seen corresponding path program 4 times [2022-11-23 03:11:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:11:17,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495569648] [2022-11-23 03:11:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:11:17,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:11:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:11:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:11:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:11:19,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495569648] [2022-11-23 03:11:19,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495569648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:11:19,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803031606] [2022-11-23 03:11:19,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 03:11:19,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:11:19,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:11:19,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:11:19,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:11:19,842 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 03:11:19,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:11:19,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-23 03:11:19,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:11:19,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 03:11:19,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:19,914 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 03:11:19,915 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-11-23 03:11:19,993 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-11-23 03:11:20,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:20,208 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-11-23 03:11:20,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:20,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:20,664 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-11-23 03:11:20,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:20,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:20,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:20,916 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-11-23 03:11:21,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:21,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:11:21,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:21,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:21,516 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-11-23 03:11:21,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:21,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:21,863 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-11-23 03:11:22,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:22,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:22,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:11:22,269 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-11-23 03:11:22,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:22,606 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-11-23 03:11:22,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:11:22,893 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-11-23 03:11:22,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:11:22,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:11:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:11:33,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803031606] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:11:33,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:11:33,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 64 [2022-11-23 03:11:33,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849530831] [2022-11-23 03:11:33,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:11:33,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-23 03:11:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:11:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-23 03:11:33,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3415, Unknown=1, NotChecked=0, Total=4032 [2022-11-23 03:11:33,305 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-11-23 03:11:43,489 WARN L233 SmtUtils]: Spent 7.42s 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-11-23 03:11:45,727 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse31 (* c_~N~0 2)) (.cse32 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse16 (+ .cse32 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse11 (+ .cse31 1)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse20 (+ .cse32 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse17 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse21 (not .cse13)) (.cse0 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (< |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int) (v_ArrVal_226 Int)) (let ((.cse1 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 .cse7 v_ArrVal_226)))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_231 (+ (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (< (+ v_ArrVal_235 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 5) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_226 1)))))) .cse8) (or (< 2 c_~N~0) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse12 |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_231 (+ (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_230 1)) (< (+ v_ArrVal_235 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse11) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (not (< 1 c_~N~0))) (or .cse13 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 .cse16 v_ArrVal_230)))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_235 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse11) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_231 (+ (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or .cse17 (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse12 .cse16 v_ArrVal_228) .cse20 v_ArrVal_230)))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_231 (+ (select (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (< (+ v_ArrVal_235 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse11))))) .cse21) (or (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 .cse20 v_ArrVal_230)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ v_ArrVal_235 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse11) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_231 (+ (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) .cse17 .cse21) (or (< |c_ULTIMATE.start_main_~i~0#1| 1) (< 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int) (v_ArrVal_226 Int)) (let ((.cse24 (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 .cse27 v_ArrVal_226)))) (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_235 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 5) (not (<= v_ArrVal_231 (+ (select (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_226 1)) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (or .cse0 .cse8 (forall ((v_ArrVal_235 Int) (v_ArrVal_223 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int) (v_ArrVal_226 Int)) (let ((.cse29 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse6 .cse27 v_ArrVal_223) .cse7 v_ArrVal_226)))) (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230))))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_231 (+ (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_226 1)) (not (<= v_ArrVal_223 1)) (< (+ v_ArrVal_235 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 5)))))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse31)))) is different from true [2022-11-23 03:11:47,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:11:49,887 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-11-23 03:12:07,618 WARN L233 SmtUtils]: Spent 11.25s 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-11-23 03:12:23,960 WARN L233 SmtUtils]: Spent 15.19s 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-11-23 03:12:25,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:12:29,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:12:39,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:12:50,079 WARN L233 SmtUtils]: Spent 9.63s 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-11-23 03:12:57,866 WARN L233 SmtUtils]: Spent 7.38s 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-11-23 03:13:16,366 WARN L233 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:13:18,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:13:29,810 WARN L233 SmtUtils]: Spent 10.66s 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-11-23 03:13:34,787 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-11-23 03:13:37,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:14:12,930 WARN L233 SmtUtils]: Spent 31.50s 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-11-23 03:14:15,371 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-11-23 03:14:18,077 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-11-23 03:14:21,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:14:29,566 WARN L233 SmtUtils]: Spent 5.16s 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-11-23 03:15:25,423 WARN L233 SmtUtils]: Spent 53.52s 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-11-23 03:15:27,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:15:33,558 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-11-23 03:15:36,181 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-11-23 03:16:08,182 WARN L233 SmtUtils]: Spent 28.10s 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-11-23 03:16:42,079 WARN L233 SmtUtils]: Spent 30.16s 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-11-23 03:16:53,615 WARN L233 SmtUtils]: Spent 10.57s 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-11-23 03:17:05,897 WARN L233 SmtUtils]: Spent 11.94s 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-11-23 03:17:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:17:05,914 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-11-23 03:17:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-23 03:17:05,914 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-11-23 03:17:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:17:05,916 INFO L225 Difference]: With dead ends: 87 [2022-11-23 03:17:05,917 INFO L226 Difference]: Without dead ends: 81 [2022-11-23 03:17:05,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4016 ImplicationChecksByTransitivity, 306.3s TimeCoverageRelationStatistics Valid=1930, Invalid=10724, Unknown=6, NotChecked=222, Total=12882 [2022-11-23 03:17:05,922 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 257 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 37.9s IncrementalHoareTripleChecker+Time [2022-11-23 03:17:05,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 115 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 914 Invalid, 13 Unknown, 5 Unchecked, 37.9s Time] [2022-11-23 03:17:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-23 03:17:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2022-11-23 03:17:05,966 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-11-23 03:17:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-11-23 03:17:05,973 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 31 [2022-11-23 03:17:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:17:05,973 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-11-23 03:17:05,974 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-11-23 03:17:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-11-23 03:17:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-23 03:17:05,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:17:05,977 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-11-23 03:17:05,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:17:06,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:17:06,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:17:06,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:17:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash 207824378, now seen corresponding path program 5 times [2022-11-23 03:17:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:17:06,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578415776] [2022-11-23 03:17:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:17:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:17:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:17:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 03:17:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:17:06,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578415776] [2022-11-23 03:17:06,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578415776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:17:06,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751608161] [2022-11-23 03:17:06,327 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 03:17:06,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:17:06,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:17:06,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:17:06,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:17:06,455 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-23 03:17:06,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:17:06,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 03:17:06,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:17:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 03:17:06,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:17:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 03:17:06,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751608161] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:17:06,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:17:06,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-23 03:17:06,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864989155] [2022-11-23 03:17:06,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:17:06,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 03:17:06,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:17:06,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 03:17:06,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-23 03:17:06,712 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-11-23 03:17:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:17:07,025 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-11-23 03:17:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 03:17:07,026 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-11-23 03:17:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:17:07,027 INFO L225 Difference]: With dead ends: 118 [2022-11-23 03:17:07,027 INFO L226 Difference]: Without dead ends: 76 [2022-11-23 03:17:07,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-23 03:17:07,028 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 90 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:17:07,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 32 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:17:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-23 03:17:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-11-23 03:17:07,068 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-11-23 03:17:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-11-23 03:17:07,070 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 33 [2022-11-23 03:17:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:17:07,070 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-11-23 03:17:07,070 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-11-23 03:17:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-11-23 03:17:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-23 03:17:07,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:17:07,077 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-11-23 03:17:07,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:17:07,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 03:17:07,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:17:07,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:17:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash 236928956, now seen corresponding path program 6 times [2022-11-23 03:17:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:17:07,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526455109] [2022-11-23 03:17:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:17:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:17:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:17:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:17:07,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:17:07,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526455109] [2022-11-23 03:17:07,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526455109] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:17:07,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128834131] [2022-11-23 03:17:07,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 03:17:07,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:17:07,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:17:07,459 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:17:07,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:17:07,578 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-23 03:17:07,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:17:07,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 03:17:07,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:17:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:17:07,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:17:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:17:07,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128834131] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:17:07,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:17:07,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-23 03:17:07,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629882901] [2022-11-23 03:17:07,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:17:07,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 03:17:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:17:07,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 03:17:07,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-23 03:17:07,789 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-11-23 03:17:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:17:08,136 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-11-23 03:17:08,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:17:08,136 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-11-23 03:17:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:17:08,137 INFO L225 Difference]: With dead ends: 71 [2022-11-23 03:17:08,137 INFO L226 Difference]: Without dead ends: 55 [2022-11-23 03:17:08,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-23 03:17:08,138 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 61 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:17:08,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 32 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:17:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-23 03:17:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-11-23 03:17:08,153 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-11-23 03:17:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-23 03:17:08,154 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 35 [2022-11-23 03:17:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:17:08,154 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-23 03:17:08,154 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-11-23 03:17:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-23 03:17:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 03:17:08,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:17:08,155 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-11-23 03:17:08,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:17:08,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:17:08,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:17:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:17:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash 315843584, now seen corresponding path program 7 times [2022-11-23 03:17:08,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:17:08,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309953107] [2022-11-23 03:17:08,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:17:08,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:17:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:17:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:17:13,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:17:13,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309953107] [2022-11-23 03:17:13,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309953107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:17:13,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127233754] [2022-11-23 03:17:13,286 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 03:17:13,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:17:13,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:17:13,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:17:13,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:17:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:17:13,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-23 03:17:13,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:17:13,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 03:17:13,577 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 03:17:13,577 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-11-23 03:17:13,695 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-11-23 03:17:13,982 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-11-23 03:17:14,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:14,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:14,281 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-11-23 03:17:14,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:14,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:14,714 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-11-23 03:17:15,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:15,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:15,172 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-11-23 03:17:15,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:15,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:15,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:15,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:15,571 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-11-23 03:17:16,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:16,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:17:16,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:16,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:16,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:16,184 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-11-23 03:17:16,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:16,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:16,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:16,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:17:16,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:16,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:16,656 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-11-23 03:17:17,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:17,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:17,176 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-11-23 03:17:17,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:17,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:17,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:17,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:17:17,830 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-11-23 03:17:18,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:18,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:18,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:18,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:17:18,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:17:18,401 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-11-23 03:17:18,943 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-11-23 03:17:19,416 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-11-23 03:17:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:17:19,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:20:51,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:20:51,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:20:51,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:20:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:20:51,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127233754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:20:51,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:20:51,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 27] total 82 [2022-11-23 03:20:51,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583940298] [2022-11-23 03:20:51,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:20:51,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-23 03:20:51,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:20:51,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-23 03:20:51,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=5963, Unknown=66, NotChecked=0, Total=6642 [2022-11-23 03:20:51,883 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-11-23 03:21:30,870 WARN L233 SmtUtils]: Spent 23.68s 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-11-23 03:21:33,621 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-11-23 03:21:35,653 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-11-23 03:21:37,673 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-11-23 03:21:39,685 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-11-23 03:21:41,693 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-11-23 03:21:44,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 03:21:56,470 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-11-23 03:22:21,876 WARN L233 SmtUtils]: Spent 21.32s 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-11-23 03:22:24,596 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-11-23 03:22:26,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 03:22:36,260 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse27 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse11 (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (.cse17 (<= (mod c_~N~0 4294967296) 536870911)) (.cse10 (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse15 (+ .cse27 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 (+ .cse27 |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) .cse17 (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 ((.cse18 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 .cse10 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) .cse5 v_ArrVal_443) .cse2 v_ArrVal_445))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |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 .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |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 .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |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 .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |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 .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |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 .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse11) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse17) (and (not .cse17) (= |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 ((.cse21 (let ((.cse23 (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 .cse23 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse23 |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 ((.cse22 (select .cse21 |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 .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |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 .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |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 .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |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 .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |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 .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |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 ((.cse24 (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 .cse9 v_ArrVal_438)))) (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse26 |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 ((.cse25 (select .cse24 |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 .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |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 .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |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 .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |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 .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |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 .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |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 .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) is different from true [2022-11-23 03:22:38,308 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse32 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse15 (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (.cse21 (<= (mod c_~N~0 4294967296) 536870911)) (.cse14 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse19 (+ .cse32 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse7 (+ (* c_~N~0 2) 1)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse3 8)) (.cse1 (select .cse3 0)) (.cse2 (select .cse3 4))) (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= .cse0 1) (<= .cse1 1) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ .cse0 .cse1 .cse2)) (<= .cse2 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 ((.cse4 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse12 .cse13 v_ArrVal_437) .cse14 v_ArrVal_438)))) (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse9 v_ArrVal_443) .cse6 v_ArrVal_445))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_455 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) .cse7) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |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 .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |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 .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))) (not (<= v_ArrVal_437 1)))))) .cse15) (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 ((.cse16 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse12 .cse14 v_ArrVal_437) .cse19 v_ArrVal_438)))) (store .cse18 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse9 v_ArrVal_443) .cse6 v_ArrVal_445))))) (let ((.cse17 (select .cse16 |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 .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |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 .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_455 (+ v_ArrVal_452 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_437 1)) (< (+ v_ArrVal_455 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) .cse7))))) .cse20) .cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (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 ((.cse22 (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 .cse14 v_ArrVal_438)))) (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_440) .cse9 v_ArrVal_443) .cse6 v_ArrVal_445))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_450 (+ v_ArrVal_448 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_448)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))) (not (<= v_ArrVal_443 1)) (not (<= v_ArrVal_438 1)) (< (+ v_ArrVal_455 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_455)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6)) .cse7) (not (<= v_ArrVal_452 (+ v_ArrVal_450 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |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 .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_452)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse9)))) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_448 (+ v_ArrVal_447 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_447)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))) (not (<= v_ArrVal_447 (+ (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse15) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse21) (and (not .cse21) (= |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|)) (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 ((.cse25 (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse12 .cse13 v_ArrVal_435) .cse14 v_ArrVal_437) .cse19 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) .cse9 v_ArrVal_443) .cse6 v_ArrVal_445))))) (let ((.cse26 (select .cse25 |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 .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_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|) .cse10)))) (< (+ 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|) .cse6)) .cse7) (not (<= v_ArrVal_445 1)) (not (<= v_ArrVal_440 1)) (not (<= v_ArrVal_447 (+ (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse26 |c_ULTIMATE.start_main_~#sum~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|) .cse9)))) (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|) .cse8)))) (not (<= v_ArrVal_437 1)))))) .cse20) (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 ((.cse28 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 .cse13 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) .cse9 v_ArrVal_443) .cse6 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_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_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|) .cse9)))) (not (<= v_ArrVal_445 1)) (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|) .cse8)))) (not (<= v_ArrVal_440 1)) (< (+ 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|) .cse6)) .cse7) (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|) .cse10)))) (not (<= v_ArrVal_447 (+ (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (<= (select .cse31 .cse9) 1) (<= (select .cse31 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (select .cse31 .cse6) 1)))) is different from true [2022-11-23 03:22:44,078 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-11-23 03:23:45,325 WARN L233 SmtUtils]: Spent 34.59s on a formula simplification that was a NOOP. DAG size: 319 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:23:47,605 WARN L859 $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) (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 true [2022-11-23 03:23:49,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:23:51,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:23:54,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:23:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:23:54,283 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-11-23 03:23:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-23 03:23:54,283 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 39 [2022-11-23 03:23:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:23:54,284 INFO L225 Difference]: With dead ends: 80 [2022-11-23 03:23:54,284 INFO L226 Difference]: Without dead ends: 76 [2022-11-23 03:23:54,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4275 ImplicationChecksByTransitivity, 362.2s TimeCoverageRelationStatistics Valid=1580, Invalid=13364, Unknown=82, NotChecked=1230, Total=16256 [2022-11-23 03:23:54,289 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 179 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 218 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:23:54,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 116 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1466 Invalid, 11 Unknown, 30 Unchecked, 33.1s Time] [2022-11-23 03:23:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-23 03:23:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 45. [2022-11-23 03:23:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-23 03:23:54,310 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2022-11-23 03:23:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:23:54,310 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-23 03:23:54,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-11-23 03:23:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-23 03:23:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 03:23:54,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:23:54,311 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:54,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 03:23:54,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:23:54,515 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:23:54,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1363759742, now seen corresponding path program 8 times [2022-11-23 03:23:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:54,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192368376] [2022-11-23 03:23:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-23 03:23:54,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:54,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192368376] [2022-11-23 03:23:54,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192368376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:23:54,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678468666] [2022-11-23 03:23:54,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:23:54,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:23:54,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:23:54,707 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:23:54,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 03:23:54,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 03:23:54,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:23:54,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 03:23:54,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:23:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-23 03:23:55,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:23:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-23 03:23:55,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678468666] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:23:55,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:23:55,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-23 03:23:55,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938421831] [2022-11-23 03:23:55,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:23:55,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 03:23:55,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:55,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 03:23:55,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-23 03:23:55,156 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:23:55,556 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-23 03:23:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 03:23:55,557 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-23 03:23:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:23:55,557 INFO L225 Difference]: With dead ends: 109 [2022-11-23 03:23:55,558 INFO L226 Difference]: Without dead ends: 56 [2022-11-23 03:23:55,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-23 03:23:55,559 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 80 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:23:55,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 39 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:23:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-23 03:23:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2022-11-23 03:23:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-11-23 03:23:55,587 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 41 [2022-11-23 03:23:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:23:55,587 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-11-23 03:23:55,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-11-23 03:23:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 03:23:55,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:23:55,591 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:55,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:23:55,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 03:23:55,798 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:23:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1762736762, now seen corresponding path program 9 times [2022-11-23 03:23:55,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:55,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179335268] [2022-11-23 03:23:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:23:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-23 03:23:56,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:23:56,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179335268] [2022-11-23 03:23:56,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179335268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:23:56,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218646619] [2022-11-23 03:23:56,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:23:56,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:23:56,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:23:56,047 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:23:56,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 03:23:56,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-23 03:23:56,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:23:56,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 03:23:56,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:23:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-23 03:23:56,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:23:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-23 03:23:56,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218646619] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:23:56,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:23:56,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-23 03:23:56,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175594722] [2022-11-23 03:23:56,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:23:56,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 03:23:56,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:23:56,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 03:23:56,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-23 03:23:56,631 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:23:57,099 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-11-23 03:23:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:23:57,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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 45 [2022-11-23 03:23:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:23:57,100 INFO L225 Difference]: With dead ends: 55 [2022-11-23 03:23:57,100 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 03:23:57,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-23 03:23:57,102 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:23:57,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 28 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:23:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 03:23:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-11-23 03:23:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-11-23 03:23:57,127 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 45 [2022-11-23 03:23:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:23:57,128 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-11-23 03:23:57,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:23:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-11-23 03:23:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-23 03:23:57,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:23:57,129 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:23:57,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 03:23:57,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:23:57,336 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:23:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:23:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1719679608, now seen corresponding path program 10 times [2022-11-23 03:23:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:23:57,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111253184] [2022-11-23 03:23:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:23:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:23:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:24:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:24:04,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:24:04,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111253184] [2022-11-23 03:24:04,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111253184] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:24:04,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731686055] [2022-11-23 03:24:04,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 03:24:04,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:24:04,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:24:04,527 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:24:04,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a69210b-6b86-464f-8a2a-52cc66c90848/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 03:24:04,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 03:24:04,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:24:04,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-23 03:24:04,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:24:04,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:04,758 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 03:24:04,758 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-11-23 03:24:04,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 03:24:04,895 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-11-23 03:24:05,140 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 35 treesize of output 37 [2022-11-23 03:24:05,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-11-23 03:24:05,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2022-11-23 03:24:06,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:06,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 81 [2022-11-23 03:24:07,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:07,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:07,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 91 [2022-11-23 03:24:07,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:07,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:07,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:07,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:07,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 103 [2022-11-23 03:24:08,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:08,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:08,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:08,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:08,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:08,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:08,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 115 [2022-11-23 03:24:09,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:24:09,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:09,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:09,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:09,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:09,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:09,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:09,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:09,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 121 [2022-11-23 03:24:10,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:24:10,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 120 [2022-11-23 03:24:10,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:24:10,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:10,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2022-11-23 03:24:11,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:11,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:11,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:11,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:11,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:11,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:11,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:11,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:24:11,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:11,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:11,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 111 [2022-11-23 03:24:12,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:12,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:12,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:12,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:12,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:12,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:12,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:12,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:24:12,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:12,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:12,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 116 [2022-11-23 03:24:13,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:24:13,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 120 [2022-11-23 03:24:13,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:24:13,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:13,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 124 [2022-11-23 03:24:14,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:14,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:14,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:14,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:14,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:14,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 14 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 109 [2022-11-23 03:24:15,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:15,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:15,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:15,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:15,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:24:15,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 14 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 39 [2022-11-23 03:24:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:24:15,709 INFO L328 TraceCheckSpWp]: Computing backward predicates...