./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/rewnif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/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_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-tiling/rewnif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/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_7421c748-ce24-4edd-9f4f-697e5b73b6ba/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 5ee21d1db2a363655b71bcb8ab92ef8d6b86a57a4ebbd79d98cb55c59d3ed1f5 --- 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 02:13:28,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:13:28,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:13:28,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:13:28,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:13:28,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:13:28,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:13:28,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:13:28,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:13:28,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:13:28,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:13:28,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:13:28,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:13:28,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:13:28,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:13:28,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:13:28,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:13:28,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:13:28,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:13:28,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:13:28,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:13:28,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:13:28,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:13:28,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:13:28,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:13:28,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:13:28,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:13:28,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:13:28,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:13:28,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:13:28,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:13:28,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:13:28,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:13:28,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:13:28,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:13:28,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:13:28,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:13:28,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:13:28,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:13:28,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:13:28,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:13:28,391 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 02:13:28,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:13:28,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:13:28,434 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:13:28,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:13:28,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:13:28,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:13:28,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:13:28,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:13:28,436 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:13:28,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:13:28,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:13:28,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:13:28,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:13:28,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:13:28,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 02:13:28,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:13:28,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 02:13:28,439 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:13:28,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 02:13:28,439 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:13:28,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 02:13:28,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:13:28,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:13:28,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:13:28,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:13:28,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:13:28,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:13:28,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 02:13:28,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:13:28,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:13:28,442 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:13:28,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 02:13:28,442 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:13:28,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:13:28,443 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_7421c748-ce24-4edd-9f4f-697e5b73b6ba/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_7421c748-ce24-4edd-9f4f-697e5b73b6ba/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 -> 5ee21d1db2a363655b71bcb8ab92ef8d6b86a57a4ebbd79d98cb55c59d3ed1f5 [2022-11-23 02:13:28,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:13:28,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:13:28,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:13:28,762 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:13:28,763 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:13:28,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/array-tiling/rewnif.c [2022-11-23 02:13:31,919 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:13:32,179 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:13:32,180 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/sv-benchmarks/c/array-tiling/rewnif.c [2022-11-23 02:13:32,188 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/data/9ec476a2b/3e8a9f1fb9914b778b9c87089bedbabc/FLAG8e69919b1 [2022-11-23 02:13:32,216 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/data/9ec476a2b/3e8a9f1fb9914b778b9c87089bedbabc [2022-11-23 02:13:32,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:13:32,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:13:32,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:13:32,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:13:32,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:13:32,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df66d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32, skipping insertion in model container [2022-11-23 02:13:32,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:13:32,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:13:32,470 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_7421c748-ce24-4edd-9f4f-697e5b73b6ba/sv-benchmarks/c/array-tiling/rewnif.c[397,410] [2022-11-23 02:13:32,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:13:32,505 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:13:32,520 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_7421c748-ce24-4edd-9f4f-697e5b73b6ba/sv-benchmarks/c/array-tiling/rewnif.c[397,410] [2022-11-23 02:13:32,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:13:32,544 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:13:32,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32 WrapperNode [2022-11-23 02:13:32,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:13:32,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:13:32,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:13:32,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:13:32,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,582 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-11-23 02:13:32,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:13:32,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:13:32,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:13:32,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:13:32,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,604 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:13:32,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:13:32,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:13:32,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:13:32,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (1/1) ... [2022-11-23 02:13:32,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:13:32,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:32,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:13:32,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:13:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:13:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:13:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:13:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 02:13:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:13:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:13:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 02:13:32,757 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:13:32,759 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:13:32,874 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:13:32,880 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:13:32,881 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 02:13:32,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:13:32 BoogieIcfgContainer [2022-11-23 02:13:32,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:13:32,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:13:32,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:13:32,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:13:32,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:13:32" (1/3) ... [2022-11-23 02:13:32,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab4a49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:13:32, skipping insertion in model container [2022-11-23 02:13:32,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:13:32" (2/3) ... [2022-11-23 02:13:32,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab4a49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:13:32, skipping insertion in model container [2022-11-23 02:13:32,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:13:32" (3/3) ... [2022-11-23 02:13:32,894 INFO L112 eAbstractionObserver]: Analyzing ICFG rewnif.c [2022-11-23 02:13:32,917 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:13:32,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 02:13:32,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:13:32,981 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;@5d353eed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:13:32,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 02:13:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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 02:13:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 02:13:32,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:32,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:32,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 133671584, now seen corresponding path program 1 times [2022-11-23 02:13:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:33,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725806194] [2022-11-23 02:13:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:33,218 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 02:13:33,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:33,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725806194] [2022-11-23 02:13:33,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725806194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:13:33,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:13:33,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:13:33,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165280703] [2022-11-23 02:13:33,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:13:33,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:13:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:13:33,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:13:33,285 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 02:13:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:33,307 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-11-23 02:13:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:13:33,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-11-23 02:13:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:33,322 INFO L225 Difference]: With dead ends: 29 [2022-11-23 02:13:33,323 INFO L226 Difference]: Without dead ends: 14 [2022-11-23 02:13:33,326 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 02:13:33,331 INFO L413 NwaCegarLoop]: 21 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, 21 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 02:13:33,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:13:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-23 02:13:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-23 02:13:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 02:13:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-23 02:13:33,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2022-11-23 02:13:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:33,362 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-23 02:13:33,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 02:13:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-11-23 02:13:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 02:13:33,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:33,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:33,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:13:33,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash 121665811, now seen corresponding path program 1 times [2022-11-23 02:13:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:33,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590563539] [2022-11-23 02:13:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:33,544 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 02:13:33,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:33,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590563539] [2022-11-23 02:13:33,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590563539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:13:33,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:13:33,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:13:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609255308] [2022-11-23 02:13:33,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:13:33,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:13:33,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:13:33,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:13:33,549 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 02:13:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:33,591 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-11-23 02:13:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:13:33,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-11-23 02:13:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:33,593 INFO L225 Difference]: With dead ends: 29 [2022-11-23 02:13:33,593 INFO L226 Difference]: Without dead ends: 18 [2022-11-23 02:13:33,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:13:33,595 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:33,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:13:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-23 02:13:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-11-23 02:13:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 02:13:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-11-23 02:13:33,601 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2022-11-23 02:13:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:33,602 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-11-23 02:13:33,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 02:13:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-11-23 02:13:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 02:13:33,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:33,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:33,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:13:33,604 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash 729197006, now seen corresponding path program 1 times [2022-11-23 02:13:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:33,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126861926] [2022-11-23 02:13:33,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:33,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126861926] [2022-11-23 02:13:33,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126861926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173044125] [2022-11-23 02:13:33,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:33,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:33,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 02:13:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:33,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 02:13:33,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:34,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:34,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173044125] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:34,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:34,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-23 02:13:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519868467] [2022-11-23 02:13:34,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:34,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:13:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:34,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:13:34,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:13:34,150 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 02:13:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:34,220 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-11-23 02:13:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:13:34,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Word has length 12 [2022-11-23 02:13:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:34,222 INFO L225 Difference]: With dead ends: 34 [2022-11-23 02:13:34,222 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 02:13:34,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:13:34,224 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:34,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 22 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:13:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 02:13:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-11-23 02:13:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 02:13:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-23 02:13:34,230 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-11-23 02:13:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:34,231 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-23 02:13:34,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 02:13:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-23 02:13:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 02:13:34,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:34,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:34,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 02:13:34,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-23 02:13:34,439 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:34,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:34,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1021157689, now seen corresponding path program 1 times [2022-11-23 02:13:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:34,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740319901] [2022-11-23 02:13:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:34,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:35,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:35,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740319901] [2022-11-23 02:13:35,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740319901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:35,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867235345] [2022-11-23 02:13:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:35,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:35,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:35,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:35,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 02:13:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:35,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 02:13:35,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:35,271 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 15 treesize of output 11 [2022-11-23 02:13:35,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:13:35,426 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 23 treesize of output 22 [2022-11-23 02:13:35,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:13:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:35,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:35,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-23 02:13:35,853 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 142 treesize of output 138 [2022-11-23 02:13:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:35,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867235345] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:35,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:35,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2022-11-23 02:13:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048838438] [2022-11-23 02:13:35,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:35,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 02:13:35,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 02:13:35,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-23 02:13:35,946 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 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 02:13:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:36,244 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-23 02:13:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:13:36,245 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 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 16 [2022-11-23 02:13:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:36,248 INFO L225 Difference]: With dead ends: 28 [2022-11-23 02:13:36,249 INFO L226 Difference]: Without dead ends: 26 [2022-11-23 02:13:36,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-11-23 02:13:36,254 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:36,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 40 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:13:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-23 02:13:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-11-23 02:13:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 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 02:13:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-23 02:13:36,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2022-11-23 02:13:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:36,273 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-23 02:13:36,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 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 02:13:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-23 02:13:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 02:13:36,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:36,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:36,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-23 02:13:36,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:36,480 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:36,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1566850755, now seen corresponding path program 1 times [2022-11-23 02:13:36,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:36,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687239526] [2022-11-23 02:13:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:36,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:36,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687239526] [2022-11-23 02:13:36,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687239526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:36,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041998513] [2022-11-23 02:13:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:36,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:36,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:36,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:36,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 02:13:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:36,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-23 02:13:36,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:36,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:13:37,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:13:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:37,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:37,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-23 02:13:37,242 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 24 treesize of output 20 [2022-11-23 02:13:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:37,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041998513] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:37,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:37,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-11-23 02:13:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090350836] [2022-11-23 02:13:37,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:37,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 02:13:37,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:37,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 02:13:37,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-23 02:13:37,278 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 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 02:13:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:37,672 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-11-23 02:13:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 02:13:37,673 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 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 20 [2022-11-23 02:13:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:37,673 INFO L225 Difference]: With dead ends: 60 [2022-11-23 02:13:37,673 INFO L226 Difference]: Without dead ends: 58 [2022-11-23 02:13:37,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-11-23 02:13:37,675 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 56 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:37,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 105 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:13:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-23 02:13:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2022-11-23 02:13:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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 02:13:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-23 02:13:37,683 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 20 [2022-11-23 02:13:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:37,684 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-23 02:13:37,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 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 02:13:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-23 02:13:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 02:13:37,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:37,685 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:37,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 02:13:37,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:37,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:37,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:37,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1995245389, now seen corresponding path program 2 times [2022-11-23 02:13:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:37,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6687554] [2022-11-23 02:13:37,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:37,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:38,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6687554] [2022-11-23 02:13:38,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6687554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:38,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277774323] [2022-11-23 02:13:38,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:13:38,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:38,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:38,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:38,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 02:13:38,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:13:38,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:13:38,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 02:13:38,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:38,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:38,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277774323] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:38,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:38,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-11-23 02:13:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457401843] [2022-11-23 02:13:38,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:38,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 02:13:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:38,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 02:13:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-23 02:13:38,311 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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 02:13:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:38,452 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-11-23 02:13:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:13:38,453 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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 24 [2022-11-23 02:13:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:38,454 INFO L225 Difference]: With dead ends: 85 [2022-11-23 02:13:38,454 INFO L226 Difference]: Without dead ends: 47 [2022-11-23 02:13:38,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-11-23 02:13:38,456 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:38,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 40 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:13:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-23 02:13:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-11-23 02:13:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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 02:13:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-11-23 02:13:38,475 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2022-11-23 02:13:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:38,476 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-11-23 02:13:38,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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 02:13:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-11-23 02:13:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 02:13:38,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:38,478 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:38,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 02:13:38,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-23 02:13:38,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1364521933, now seen corresponding path program 3 times [2022-11-23 02:13:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:38,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119846336] [2022-11-23 02:13:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:39,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:39,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119846336] [2022-11-23 02:13:39,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119846336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:39,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64160976] [2022-11-23 02:13:39,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:13:39,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:39,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:39,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:39,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 02:13:39,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-23 02:13:39,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:13:39,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-23 02:13:39,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:39,530 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 15 treesize of output 11 [2022-11-23 02:13:39,607 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 31 treesize of output 30 [2022-11-23 02:13:39,625 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 30 treesize of output 29 [2022-11-23 02:13:39,692 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 23 treesize of output 22 [2022-11-23 02:13:39,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:13:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:39,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:40,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-23 02:13:40,175 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 139 treesize of output 131 [2022-11-23 02:13:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:40,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64160976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:40,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:40,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 23 [2022-11-23 02:13:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793750039] [2022-11-23 02:13:40,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:40,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 02:13:40,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:40,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 02:13:40,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-11-23 02:13:40,244 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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 02:13:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:40,753 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-11-23 02:13:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 02:13:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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 28 [2022-11-23 02:13:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:40,754 INFO L225 Difference]: With dead ends: 67 [2022-11-23 02:13:40,754 INFO L226 Difference]: Without dead ends: 65 [2022-11-23 02:13:40,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 02:13:40,756 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 143 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:40,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 98 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 02:13:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-23 02:13:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 29. [2022-11-23 02:13:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 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 02:13:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-11-23 02:13:40,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2022-11-23 02:13:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:40,766 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-11-23 02:13:40,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 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 02:13:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-11-23 02:13:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 02:13:40,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:40,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:40,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 02:13:40,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:40,974 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1191072622, now seen corresponding path program 4 times [2022-11-23 02:13:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:40,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171157043] [2022-11-23 02:13:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:41,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:41,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171157043] [2022-11-23 02:13:41,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171157043] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:41,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563608864] [2022-11-23 02:13:41,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 02:13:41,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:41,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:41,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:41,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 02:13:41,432 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 02:13:41,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:13:41,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 02:13:41,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:41,533 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 15 treesize of output 11 [2022-11-23 02:13:41,834 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-23 02:13:41,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-23 02:13:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:41,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:42,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-23 02:13:42,137 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 34 treesize of output 28 [2022-11-23 02:13:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563608864] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:42,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:42,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-11-23 02:13:42,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071243438] [2022-11-23 02:13:42,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:42,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 02:13:42,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:42,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 02:13:42,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-11-23 02:13:42,241 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 02:13:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:43,620 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-11-23 02:13:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-23 02:13:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 28 [2022-11-23 02:13:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:43,622 INFO L225 Difference]: With dead ends: 87 [2022-11-23 02:13:43,622 INFO L226 Difference]: Without dead ends: 68 [2022-11-23 02:13:43,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=416, Invalid=2340, Unknown=0, NotChecked=0, Total=2756 [2022-11-23 02:13:43,624 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 148 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:43,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 154 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 02:13:43,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-23 02:13:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2022-11-23 02:13:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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 02:13:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-11-23 02:13:43,642 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 28 [2022-11-23 02:13:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:43,644 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-11-23 02:13:43,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 02:13:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-11-23 02:13:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 02:13:43,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:43,647 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:43,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 02:13:43,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:43,849 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash 367413348, now seen corresponding path program 5 times [2022-11-23 02:13:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:43,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408396360] [2022-11-23 02:13:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:43,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:44,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408396360] [2022-11-23 02:13:44,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408396360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910264870] [2022-11-23 02:13:44,491 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 02:13:44,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:44,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:44,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:44,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 02:13:44,618 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-23 02:13:44,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:13:44,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-23 02:13:44,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:44,744 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 15 treesize of output 11 [2022-11-23 02:13:44,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:13:44,821 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 26 treesize of output 25 [2022-11-23 02:13:44,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:13:44,837 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 25 treesize of output 24 [2022-11-23 02:13:44,897 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 23 treesize of output 22 [2022-11-23 02:13:45,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:13:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:45,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:45,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-11-23 02:13:45,552 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 137 treesize of output 129 [2022-11-23 02:13:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:45,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910264870] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:45,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:45,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 29 [2022-11-23 02:13:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82765351] [2022-11-23 02:13:45,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:45,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 02:13:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:45,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 02:13:45,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2022-11-23 02:13:45,645 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 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 02:13:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:46,538 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-11-23 02:13:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 02:13:46,539 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 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 36 [2022-11-23 02:13:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:46,540 INFO L225 Difference]: With dead ends: 79 [2022-11-23 02:13:46,540 INFO L226 Difference]: Without dead ends: 77 [2022-11-23 02:13:46,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=1903, Unknown=0, NotChecked=0, Total=2256 [2022-11-23 02:13:46,542 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 128 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:46,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 166 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 02:13:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-23 02:13:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 37. [2022-11-23 02:13:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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 02:13:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-11-23 02:13:46,558 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2022-11-23 02:13:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:46,559 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-11-23 02:13:46,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 29 states have internal predecessors, (80), 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 02:13:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-11-23 02:13:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 02:13:46,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:46,568 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:46,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 02:13:46,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:46,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:46,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:46,776 INFO L85 PathProgramCache]: Analyzing trace with hash 947747359, now seen corresponding path program 6 times [2022-11-23 02:13:46,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:46,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796845727] [2022-11-23 02:13:46,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:47,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796845727] [2022-11-23 02:13:47,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796845727] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:47,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135569518] [2022-11-23 02:13:47,270 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 02:13:47,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:47,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:47,272 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:47,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 02:13:47,383 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-23 02:13:47,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:13:47,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 02:13:47,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:47,498 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 15 treesize of output 11 [2022-11-23 02:13:48,011 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-23 02:13:48,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-23 02:13:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:48,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:48,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-23 02:13:48,475 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 34 treesize of output 28 [2022-11-23 02:13:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:48,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135569518] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:48,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:48,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 31 [2022-11-23 02:13:48,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427678991] [2022-11-23 02:13:48,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:48,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 02:13:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:48,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 02:13:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-11-23 02:13:48,594 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 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 02:13:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:50,191 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-11-23 02:13:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-23 02:13:50,192 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 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 36 [2022-11-23 02:13:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:50,193 INFO L225 Difference]: With dead ends: 103 [2022-11-23 02:13:50,193 INFO L226 Difference]: Without dead ends: 80 [2022-11-23 02:13:50,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=570, Invalid=3336, Unknown=0, NotChecked=0, Total=3906 [2022-11-23 02:13:50,195 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 219 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:50,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 155 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 02:13:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-23 02:13:50,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2022-11-23 02:13:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 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 02:13:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-11-23 02:13:50,207 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 36 [2022-11-23 02:13:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:50,208 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-11-23 02:13:50,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 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 02:13:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-11-23 02:13:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 02:13:50,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:50,209 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:50,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 02:13:50,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 02:13:50,416 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash -470542059, now seen corresponding path program 7 times [2022-11-23 02:13:50,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:50,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410428985] [2022-11-23 02:13:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:51,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410428985] [2022-11-23 02:13:51,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410428985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:51,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746166316] [2022-11-23 02:13:51,158 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 02:13:51,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:51,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:51,163 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:51,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 02:13:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:51,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 02:13:51,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:51,393 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 15 treesize of output 11 [2022-11-23 02:13:51,493 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 31 treesize of output 30 [2022-11-23 02:13:51,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-11-23 02:13:51,610 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 30 treesize of output 29 [2022-11-23 02:13:51,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 02:13:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:51,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:52,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-23 02:13:52,364 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 546 treesize of output 530 [2022-11-23 02:13:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:52,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746166316] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:52,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:52,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 32 [2022-11-23 02:13:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881249799] [2022-11-23 02:13:52,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:52,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 02:13:52,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:52,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 02:13:52,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2022-11-23 02:13:52,926 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 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 02:13:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:53,774 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-11-23 02:13:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 02:13:53,775 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 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 44 [2022-11-23 02:13:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:53,776 INFO L225 Difference]: With dead ends: 91 [2022-11-23 02:13:53,776 INFO L226 Difference]: Without dead ends: 89 [2022-11-23 02:13:53,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=1844, Unknown=0, NotChecked=0, Total=2162 [2022-11-23 02:13:53,777 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 150 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:53,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 205 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 02:13:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-23 02:13:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 45. [2022-11-23 02:13:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 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 02:13:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-11-23 02:13:53,799 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2022-11-23 02:13:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:53,799 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-11-23 02:13:53,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 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 02:13:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-11-23 02:13:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 02:13:53,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:53,802 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:53,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 02:13:54,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 02:13:54,010 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1613367984, now seen corresponding path program 8 times [2022-11-23 02:13:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:54,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317069608] [2022-11-23 02:13:54,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:54,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:54,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317069608] [2022-11-23 02:13:54,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317069608] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:54,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688509160] [2022-11-23 02:13:54,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:13:54,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:54,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:54,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:54,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 02:13:54,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:13:54,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:13:54,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 02:13:54,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:54,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:13:55,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:13:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:55,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:55,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-11-23 02:13:55,217 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 24 treesize of output 20 [2022-11-23 02:13:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:55,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688509160] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:55,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:55,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-11-23 02:13:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245364678] [2022-11-23 02:13:55,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:55,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 02:13:55,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:55,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 02:13:55,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2022-11-23 02:13:55,286 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 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 02:13:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:56,061 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-11-23 02:13:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 02:13:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 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 44 [2022-11-23 02:13:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:56,063 INFO L225 Difference]: With dead ends: 96 [2022-11-23 02:13:56,063 INFO L226 Difference]: Without dead ends: 94 [2022-11-23 02:13:56,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=1930, Unknown=0, NotChecked=0, Total=2162 [2022-11-23 02:13:56,065 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 101 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:56,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 256 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 02:13:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-23 02:13:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2022-11-23 02:13:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 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 02:13:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-11-23 02:13:56,082 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 44 [2022-11-23 02:13:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:56,083 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-11-23 02:13:56,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 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 02:13:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-11-23 02:13:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 02:13:56,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:56,084 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:56,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 02:13:56,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 02:13:56,287 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 924773190, now seen corresponding path program 9 times [2022-11-23 02:13:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:56,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278268790] [2022-11-23 02:13:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:56,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278268790] [2022-11-23 02:13:56,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278268790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:56,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748184877] [2022-11-23 02:13:56,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:13:56,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:56,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:56,534 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:56,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 02:13:56,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-23 02:13:56,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:13:56,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 02:13:56,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:56,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:57,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748184877] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:57,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:57,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2022-11-23 02:13:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225687787] [2022-11-23 02:13:57,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:57,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 02:13:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:57,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 02:13:57,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-11-23 02:13:57,033 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 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 02:13:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:13:57,272 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2022-11-23 02:13:57,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 02:13:57,273 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 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 48 [2022-11-23 02:13:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:13:57,274 INFO L225 Difference]: With dead ends: 114 [2022-11-23 02:13:57,274 INFO L226 Difference]: Without dead ends: 83 [2022-11-23 02:13:57,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2022-11-23 02:13:57,278 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 103 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:13:57,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 90 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:13:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-23 02:13:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2022-11-23 02:13:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 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 02:13:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-11-23 02:13:57,309 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 48 [2022-11-23 02:13:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:13:57,310 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-11-23 02:13:57,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 22 states have internal predecessors, (80), 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 02:13:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-11-23 02:13:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-23 02:13:57,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:13:57,313 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:13:57,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-23 02:13:57,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:57,518 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:13:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:13:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 730938950, now seen corresponding path program 10 times [2022-11-23 02:13:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:13:57,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301983738] [2022-11-23 02:13:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:13:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:13:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:13:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:58,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:13:58,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301983738] [2022-11-23 02:13:58,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301983738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:13:58,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956187406] [2022-11-23 02:13:58,239 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 02:13:58,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:13:58,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:13:58,243 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:13:58,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 02:13:58,517 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 02:13:58,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:13:58,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-23 02:13:58,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:13:58,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 02:13:58,676 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-23 02:13:58,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-11-23 02:13:58,702 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-23 02:13:58,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 02:13:58,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:13:58,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 02:13:59,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:13:59,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-11-23 02:13:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:59,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:13:59,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-23 02:13:59,522 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 71 treesize of output 67 [2022-11-23 02:13:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:13:59,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956187406] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:13:59,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:13:59,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 37 [2022-11-23 02:13:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897592332] [2022-11-23 02:13:59,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:13:59,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-23 02:13:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:13:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-23 02:13:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 02:13:59,812 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 37 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 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 02:14:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:14:00,770 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-11-23 02:14:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 02:14:00,771 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 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 52 [2022-11-23 02:14:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:14:00,772 INFO L225 Difference]: With dead ends: 101 [2022-11-23 02:14:00,772 INFO L226 Difference]: Without dead ends: 99 [2022-11-23 02:14:00,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=393, Invalid=2469, Unknown=0, NotChecked=0, Total=2862 [2022-11-23 02:14:00,774 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 203 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:14:00,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 245 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 02:14:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-23 02:14:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2022-11-23 02:14:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 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 02:14:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-11-23 02:14:00,789 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2022-11-23 02:14:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:14:00,789 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-11-23 02:14:00,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 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 02:14:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-11-23 02:14:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-23 02:14:00,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:14:00,790 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:14:00,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 02:14:00,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:14:00,991 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:14:00,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:14:00,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1215546761, now seen corresponding path program 11 times [2022-11-23 02:14:00,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:14:00,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784817374] [2022-11-23 02:14:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:14:00,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:14:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:14:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 51 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:14:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:14:01,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784817374] [2022-11-23 02:14:01,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784817374] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:14:01,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845403326] [2022-11-23 02:14:01,260 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 02:14:01,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:14:01,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:14:01,263 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:14:01,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 02:14:01,444 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-11-23 02:14:01,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:14:01,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-23 02:14:01,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:14:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 72 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:14:01,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:14:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 72 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:14:01,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845403326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:14:01,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:14:01,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2022-11-23 02:14:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890695205] [2022-11-23 02:14:01,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:14:01,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 02:14:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:14:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 02:14:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-11-23 02:14:01,966 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 25 states, 25 states have (on average 3.68) internal successors, (92), 25 states have internal predecessors, (92), 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 02:14:02,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:14:02,246 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-11-23 02:14:02,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 02:14:02,247 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.68) internal successors, (92), 25 states have internal predecessors, (92), 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 56 [2022-11-23 02:14:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:14:02,248 INFO L225 Difference]: With dead ends: 100 [2022-11-23 02:14:02,248 INFO L226 Difference]: Without dead ends: 65 [2022-11-23 02:14:02,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 90 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2022-11-23 02:14:02,250 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 84 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:14:02,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 126 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:14:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-23 02:14:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-11-23 02:14:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 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 02:14:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-11-23 02:14:02,274 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2022-11-23 02:14:02,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:14:02,274 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-11-23 02:14:02,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.68) internal successors, (92), 25 states have internal predecessors, (92), 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 02:14:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-11-23 02:14:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 02:14:02,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:14:02,275 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:14:02,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 02:14:02,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 02:14:02,482 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:14:02,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:14:02,482 INFO L85 PathProgramCache]: Analyzing trace with hash -836376270, now seen corresponding path program 12 times [2022-11-23 02:14:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:14:02,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037011626] [2022-11-23 02:14:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:14:02,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:14:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:14:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:14:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:14:03,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037011626] [2022-11-23 02:14:03,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037011626] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:14:03,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235346792] [2022-11-23 02:14:03,206 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 02:14:03,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:14:03,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:14:03,211 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:14:03,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 02:14:03,595 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-11-23 02:14:03,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:14:03,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 02:14:03,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:14:03,749 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 15 treesize of output 11 [2022-11-23 02:14:03,950 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-23 02:14:03,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-11-23 02:14:05,288 INFO L321 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2022-11-23 02:14:05,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 13 [2022-11-23 02:14:05,337 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 62 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:14:05,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:14:10,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-23 02:14:10,731 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 85 treesize of output 78 [2022-11-23 02:14:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 39 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:14:10,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235346792] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:14:10,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:14:10,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 51 [2022-11-23 02:14:10,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924747339] [2022-11-23 02:14:10,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:14:10,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-23 02:14:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:14:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-23 02:14:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=2224, Unknown=1, NotChecked=0, Total=2550 [2022-11-23 02:14:10,955 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 51 states, 51 states have (on average 3.0392156862745097) internal successors, (155), 51 states have internal predecessors, (155), 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 02:14:18,639 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 02:14:20,649 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 02:14:40,294 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 02:14:46,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 6 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (forall ((v_ArrVal_528 Int) (|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select (store .cse0 .cse1 v_ArrVal_528) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= |c_ULTIMATE.start_main_~i~0#1| v_ArrVal_528)) (< |v_ULTIMATE.start_main_~i~0#1_216| 5) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_216| 1)))) (or (not (< .cse2 c_~SIZE~0)) (< |c_ULTIMATE.start_main_~i~0#1| (select .cse0 (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| 5) (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) c_~SIZE~0)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_216|)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) c_~SIZE~0)))) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~SIZE~0)) (< |c_ULTIMATE.start_main_~i~0#1| (+ (select .cse0 .cse1) 1)))))) is different from false [2022-11-23 02:15:03,121 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 02:15:13,023 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 6 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (forall ((v_ArrVal_528 Int) (|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select (store .cse0 .cse1 v_ArrVal_528) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= |c_ULTIMATE.start_main_~i~0#1| v_ArrVal_528)) (< |v_ULTIMATE.start_main_~i~0#1_216| 5) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_216| 1)))) (or (not (< .cse2 c_~SIZE~0)) (< |c_ULTIMATE.start_main_~i~0#1| (select .cse0 (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| 5) (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) c_~SIZE~0)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_216|)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) c_~SIZE~0)))) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~SIZE~0)) (< |c_ULTIMATE.start_main_~i~0#1| (+ (select .cse0 .cse1) 1)))))) is different from false [2022-11-23 02:15:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:15:13,548 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-11-23 02:15:13,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-23 02:15:13,549 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.0392156862745097) internal successors, (155), 51 states have internal predecessors, (155), 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 60 [2022-11-23 02:15:13,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:15:13,549 INFO L225 Difference]: With dead ends: 142 [2022-11-23 02:15:13,549 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 02:15:13,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 125 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4081 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=1957, Invalid=13538, Unknown=13, NotChecked=494, Total=16002 [2022-11-23 02:15:13,554 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 545 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 242 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:15:13,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 228 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1276 Invalid, 4 Unknown, 2 Unchecked, 10.2s Time] [2022-11-23 02:15:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 02:15:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 02:15:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 02:15:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 02:15:13,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2022-11-23 02:15:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:15:13,555 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 02:15:13,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.0392156862745097) internal successors, (155), 51 states have internal predecessors, (155), 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 02:15:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 02:15:13,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 02:15:13,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 02:15:13,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 02:15:13,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 02:15:13,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 02:20:11,187 WARN L233 SmtUtils]: Spent 4.96m on a formula simplification. DAG size of input: 385 DAG size of output: 384 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 02:20:20,938 WARN L233 SmtUtils]: Spent 9.12s on a formula simplification. DAG size of input: 384 DAG size of output: 167 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 02:20:22,462 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 37) no Hoare annotation was computed. [2022-11-23 02:20:22,462 INFO L899 garLoopResultBuilder]: For program point L19-1(lines 19 37) no Hoare annotation was computed. [2022-11-23 02:20:22,462 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-23 02:20:22,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 02:20:22,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-23 02:20:22,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-11-23 02:20:22,462 INFO L899 garLoopResultBuilder]: For program point L24-2(lines 24 31) no Hoare annotation was computed. [2022-11-23 02:20:22,463 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 31) the Hoare annotation is: (let ((.cse14 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse14))) (let ((.cse8 (forall ((v_ArrVal_528 Int) (|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select (store .cse4 .cse16 v_ArrVal_528) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~i~0#1| v_ArrVal_528)) (< |v_ULTIMATE.start_main_~i~0#1_216| 5) (< |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_216| 1))))) (.cse13 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse15 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)) (.cse7 (<= (+ (div (- |ULTIMATE.start_main_~a~0#1.offset|) 4) 4) |ULTIMATE.start_main_~i~0#1|)) (.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse9 (<= 5 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= ~SIZE~0 |ULTIMATE.start_main_~i~0#1|)) (.cse10 (<= 3 (select .cse4 12))) (.cse11 (<= 4 (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 16)))) (.cse2 (<= 1 (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (.cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse12 (<= 5 (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 20)))) (.cse5 (<= 2 (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (.cse6 (= (select .cse4 0) 0))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0)) (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_main_~i~0#1_83| Int)) (and (not (< (+ |v_ULTIMATE.start_main_~i~0#1_83| 1) ~SIZE~0)) (<= |v_ULTIMATE.start_main_~i~0#1_83| 3) (<= |v_ULTIMATE.start_main_~i~0#1_83| (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4)))))) .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse1 .cse10 .cse11 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse2 .cse3 (= 16 .cse14) .cse15 .cse5 .cse6) (and (or (and .cse0 .cse10 (= 5 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse11 .cse2 .cse3 .cse15 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse11 .cse2 .cse3 .cse15 .cse12 .cse5 .cse6)) .cse8) (and .cse0 .cse13 .cse2 .cse3 (<= .cse16 12) .cse15 .cse5 .cse6) (and (<= ~SIZE~0 2) .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse2 .cse6) (and .cse0 .cse2 .cse3 .cse15 (= 8 .cse14) .cse6) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse15 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse11 .cse2 .cse3 (<= ~SIZE~0 5) .cse5 .cse6) (and .cse7 .cse0 .cse9 .cse1 .cse10 .cse11 .cse2 (<= ~SIZE~0 6) .cse3 .cse12 .cse5 .cse6))))) [2022-11-23 02:20:22,463 INFO L899 garLoopResultBuilder]: For program point L24-4(lines 24 31) no Hoare annotation was computed. [2022-11-23 02:20:22,463 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-11-23 02:20:22,463 INFO L899 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2022-11-23 02:20:22,463 INFO L899 garLoopResultBuilder]: For program point L8-3(line 8) no Hoare annotation was computed. [2022-11-23 02:20:22,463 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 02:20:22,463 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 33 36) no Hoare annotation was computed. [2022-11-23 02:20:22,464 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 36) the Hoare annotation is: (let ((.cse15 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse10 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse34 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse15))) (let ((.cse12 (select .cse10 .cse34))) (let ((.cse9 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse32 (select .cse10 12)) (.cse2 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse19 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (.cse14 (= (select .cse10 0) 0)) (.cse1 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse25 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse7 (<= 1 (select .cse10 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (.cse26 (= .cse12 0))) (let ((.cse17 (or (and .cse1 .cse2 .cse19 .cse5 .cse7 .cse14) (and .cse1 .cse25 .cse7 .cse26))) (.cse18 (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1)) (.cse30 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse0 (<= (+ (div (- |ULTIMATE.start_main_~a~0#1.offset|) 4) 4) |ULTIMATE.start_main_~i~0#1|)) (.cse3 (<= 3 .cse32)) (.cse23 (<= |ULTIMATE.start_main_~i~0#1| 2)) (.cse31 (<= .cse9 .cse32)) (.cse4 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse6 (<= 4 (select .cse10 (+ |ULTIMATE.start_main_~a~0#1.offset| 16)))) (.cse8 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse33 (<= .cse34 12)) (.cse27 (<= |ULTIMATE.start_main_~i~0#1| .cse12)) (.cse13 (<= 2 (select .cse10 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))))) (let ((.cse21 (or (and .cse1 .cse2 .cse23 .cse5 .cse7 .cse8 .cse27 .cse14 .cse31) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse27 .cse13 .cse14))) (.cse20 (exists ((|v_ULTIMATE.start_main_~i~0#1_83| Int)) (and (not (< (+ |v_ULTIMATE.start_main_~i~0#1_83| 1) ~SIZE~0)) (<= |v_ULTIMATE.start_main_~i~0#1_83| 3) (<= |v_ULTIMATE.start_main_~i~0#1_83| (select .cse10 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))))) (.cse16 (not (< .cse9 ~SIZE~0))) (.cse24 (<= ~SIZE~0 2)) (.cse29 (or (and .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse33 .cse27 .cse13 .cse14) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 4) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14))) (.cse22 (<= ~SIZE~0 5)) (.cse28 (or (and .cse25 .cse17 .cse3 .cse13) (and .cse17 .cse18 .cse19 .cse6 (<= .cse30 .cse32) .cse13))) (.cse11 (<= 5 (select .cse10 (+ |ULTIMATE.start_main_~a~0#1.offset| 20))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= .cse9 |v_ULTIMATE.start_main_~i~0#1_216|)) (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse10 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) ~SIZE~0)))) .cse11 (or (not (< |ULTIMATE.start_main_~i~0#1| ~SIZE~0)) (< |ULTIMATE.start_main_~i~0#1| (+ .cse12 1))) .cse13 .cse14 (or (< |ULTIMATE.start_main_~i~0#1| (select .cse10 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse15 4))) .cse16)) (and .cse17 .cse18 .cse19 .cse20 .cse13) (and .cse4 .cse21 .cse22) (and .cse23 (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse10 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_216| (+ 3 |ULTIMATE.start_main_~i~0#1|)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) ~SIZE~0)))) .cse6 .cse21 .cse11) (and .cse24 .cse1 .cse25 .cse7 .cse26) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (and (not (< (+ |v_ULTIMATE.start_main_~i~0#1_55| 1) ~SIZE~0)) (<= |v_ULTIMATE.start_main_~i~0#1_55| (select .cse10 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_55| 4)))) (<= |v_ULTIMATE.start_main_~i~0#1_55| 2))) .cse1 .cse2 .cse19 .cse5 .cse7 .cse14) (and .cse25 .cse17 .cse3 .cse6 .cse22 .cse13) (and .cse1 .cse2 .cse18 .cse23 .cse5 .cse7 .cse8 .cse27 .cse20 .cse14) (and .cse25 .cse17 (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= |ULTIMATE.start_main_~i~0#1| 3) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)) (<= |ULTIMATE.start_main_~i~0#1| (select .cse10 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) .cse13) (and .cse0 .cse1 .cse2 (<= 5 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 .cse5 .cse7 .cse8 .cse22 .cse13 .cse14) (and .cse28 .cse2 .cse22) (and .cse1 .cse2 .cse18 .cse4 .cse5 .cse7 .cse8 .cse20 .cse13 .cse14) (and .cse1 .cse2 .cse5 .cse7 .cse8 (= 8 .cse15) .cse16 .cse13 .cse14) (and .cse24 .cse1 .cse2 .cse5 .cse8 .cse14) (and .cse29 (= 3 |ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse10 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_216| .cse30) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) ~SIZE~0)))) .cse6 .cse11) (and .cse29 .cse22 (<= 4 |ULTIMATE.start_main_~i~0#1|)) (and .cse1 .cse2 .cse23 .cse5 .cse6 .cse7 .cse8 .cse22 .cse27 .cse14 .cse31) (and .cse28 (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse10 (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_216| 5) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) ~SIZE~0)))) .cse6 .cse11)))))))) [2022-11-23 02:20:22,464 INFO L902 garLoopResultBuilder]: At program point L38(lines 16 39) the Hoare annotation is: true [2022-11-23 02:20:22,464 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 29) no Hoare annotation was computed. [2022-11-23 02:20:22,464 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 29) no Hoare annotation was computed. [2022-11-23 02:20:22,467 INFO L444 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1, 1] [2022-11-23 02:20:22,469 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:20:22,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,513 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,513 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,513 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,513 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,524 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,524 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,525 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,525 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,526 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,526 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,526 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,526 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,527 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,527 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,527 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,528 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,528 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,529 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,529 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,529 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,532 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,532 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,533 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,533 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,533 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,534 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,534 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,534 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,535 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,546 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,546 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,547 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,547 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,547 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,553 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,553 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,553 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,554 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,554 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,555 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,555 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,555 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,556 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,556 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,556 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,557 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:20:22 BoogieIcfgContainer [2022-11-23 02:20:22,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:20:22,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:20:22,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:20:22,566 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:20:22,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:13:32" (3/4) ... [2022-11-23 02:20:22,582 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 02:20:22,593 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-23 02:20:22,593 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-23 02:20:22,593 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-23 02:20:22,594 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 02:20:22,622 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a == 0 && i == 0) && 2 <= SIZE) || ((((((a == 0 && SIZE <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((-a / 4 + 4 <= i && a == 0) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1)) && 5 <= i) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 16 == i * 4) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 5 == i) && 3 <= i) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1))) || (((((((a == 0 && 3 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((SIZE <= 2 && a == 0) && 1 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((a == 0 && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 8 == i * 4) && unknown-#memory_int-unknown[a][0] == 0)) || (((a == 0 && i == 1) && i + 1 <= SIZE) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((-a / 4 + 4 <= i && a == 0) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((-a / 4 + 4 <= i && a == 0) && 5 <= i) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && SIZE <= 6) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) [2022-11-23 02:20:22,623 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (!(i + 1 <= v_ULTIMATE.start_main_~i~0#1_216) || v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4]) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && (!(i < SIZE) || i < unknown-#memory_int-unknown[a][a + i * 4] + 1)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) && (i < unknown-#memory_int-unknown[a][a + i * 4 + 4] || !(i + 1 < SIZE))) || ((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || ((3 <= i && (((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12]) || ((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0))) && SIZE <= 5)) || ((((i <= 2 && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 3 + i) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && (((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12]) || ((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0))) && 5 <= unknown-#memory_int-unknown[a][a + 20])) || ((((SIZE <= 2 && a == 0) && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) || (((((((\exists v_ULTIMATE.start_main_~i~0#1_55 : int :: (!(v_ULTIMATE.start_main_~i~0#1_55 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_55 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_55 * 4]) && v_ULTIMATE.start_main_~i~0#1_55 <= 2) && a == 0) && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || (((((((((a == 0 && 1 <= i) && cond == 1) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && unknown-#memory_int-unknown[a][0] == 0)) || (((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && (\exists ULTIMATE.start_main_~i~0#1 : int :: (ULTIMATE.start_main_~i~0#1 <= 3 && !(ULTIMATE.start_main_~i~0#1 + 1 < SIZE)) && ULTIMATE.start_main_~i~0#1 <= unknown-#memory_int-unknown[a][a + ULTIMATE.start_main_~i~0#1 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || (((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 2 + i <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8])) && 1 <= i) && SIZE <= 5)) || (((((((((a == 0 && 1 <= i) && cond == 1) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((((a == 0 && 1 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 8 == i * 4) && !(i + 1 < SIZE)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((SIZE <= 2 && a == 0) && 1 <= i) && !(cond == 0)) && 2 <= i) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && 3 == i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 2 + i) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 5 <= unknown-#memory_int-unknown[a][a + 20])) || ((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && SIZE <= 5) && 4 <= i)) || ((((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12])) || (((((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || (((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 2 + i <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8])) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 5) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 5 <= unknown-#memory_int-unknown[a][a + 20]) [2022-11-23 02:20:22,633 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 02:20:22,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:20:22,634 INFO L158 Benchmark]: Toolchain (without parser) took 410412.31ms. Allocated memory was 136.3MB in the beginning and 373.3MB in the end (delta: 237.0MB). Free memory was 106.3MB in the beginning and 293.2MB in the end (delta: -186.9MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2022-11-23 02:20:22,634 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:20:22,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.90ms. Allocated memory is still 136.3MB. Free memory was 106.3MB in the beginning and 95.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 02:20:22,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.89ms. Allocated memory is still 136.3MB. Free memory was 95.8MB in the beginning and 94.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:20:22,635 INFO L158 Benchmark]: Boogie Preprocessor took 24.04ms. Allocated memory is still 136.3MB. Free memory was 94.2MB in the beginning and 93.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:20:22,635 INFO L158 Benchmark]: RCFGBuilder took 275.92ms. Allocated memory is still 136.3MB. Free memory was 92.6MB in the beginning and 82.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 02:20:22,636 INFO L158 Benchmark]: TraceAbstraction took 409679.10ms. Allocated memory was 136.3MB in the beginning and 373.3MB in the end (delta: 237.0MB). Free memory was 81.6MB in the beginning and 295.3MB in the end (delta: -213.7MB). Peak memory consumption was 202.3MB. Max. memory is 16.1GB. [2022-11-23 02:20:22,636 INFO L158 Benchmark]: Witness Printer took 67.50ms. Allocated memory is still 373.3MB. Free memory was 295.3MB in the beginning and 293.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:20:22,642 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.90ms. Allocated memory is still 136.3MB. Free memory was 106.3MB in the beginning and 95.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.89ms. Allocated memory is still 136.3MB. Free memory was 95.8MB in the beginning and 94.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.04ms. Allocated memory is still 136.3MB. Free memory was 94.2MB in the beginning and 93.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 275.92ms. Allocated memory is still 136.3MB. Free memory was 92.6MB in the beginning and 82.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 409679.10ms. Allocated memory was 136.3MB in the beginning and 373.3MB in the end (delta: 237.0MB). Free memory was 81.6MB in the beginning and 295.3MB in the end (delta: -213.7MB). Peak memory consumption was 202.3MB. Max. memory is 16.1GB. * Witness Printer took 67.50ms. Allocated memory is still 373.3MB. Free memory was 295.3MB in the beginning and 293.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 409.5s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 71.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 308.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2011 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2011 mSDsluCounter, 1967 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 1727 mSDsCounter, 860 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6152 IncrementalHoareTripleChecker+Invalid, 7018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 860 mSolverCounterUnsat, 240 mSDtfsCounter, 6152 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1420 GetRequests, 769 SyntacticMatches, 72 SemanticMatches, 579 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9813 ImplicationChecksByTransitivity, 68.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=12, InterpolantAutomatonStates: 413, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 317 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 71 NumberOfFragments, 2488 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1453 FormulaSimplificationTreeSizeReduction, 298.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 43086589 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1484 ConstructedInterpolants, 136 QuantifiedInterpolants, 14243 SizeOfPredicates, 123 NumberOfNonLiveVariables, 1925 ConjunctsInSsa, 336 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 483/2583 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant [2022-11-23 02:20:22,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,682 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,682 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,682 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,682 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,683 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,687 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,688 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,688 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,688 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,689 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,691 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,693 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,693 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,694 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-11-23 02:20:22,694 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,694 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] Derived loop invariant: (((((((((((a == 0 && i == 0) && 2 <= SIZE) || ((((((a == 0 && SIZE <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((-a / 4 + 4 <= i && a == 0) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1)) && 5 <= i) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 16 == i * 4) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 5 == i) && 3 <= i) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((a == 0 && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && (forall v_ArrVal_528 : int, v_ULTIMATE.start_main_~i~0#1_216 : int :: ((v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][a + i * 4 := v_ArrVal_528][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || !(i <= v_ArrVal_528)) || v_ULTIMATE.start_main_~i~0#1_216 < 5) || i < v_ULTIMATE.start_main_~i~0#1_216 + 1))) || (((((((a == 0 && 3 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i + 1 <= SIZE) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((SIZE <= 2 && a == 0) && 1 <= i) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((a == 0 && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i + 1 <= SIZE) && 8 == i * 4) && unknown-#memory_int-unknown[a][0] == 0)) || (((a == 0 && i == 1) && i + 1 <= SIZE) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((-a / 4 + 4 <= i && a == 0) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((((((((-a / 4 + 4 <= i && a == 0) && 5 <= i) && SIZE <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && SIZE <= 6) && 2 <= i) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) - InvariantResult [Line: 33]: Loop Invariant [2022-11-23 02:20:22,697 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,697 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,697 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,697 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,698 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,699 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,699 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,699 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,699 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,700 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,701 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,702 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,703 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,704 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,705 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,706 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,707 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,708 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,712 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,713 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,714 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,715 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,716 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,716 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,716 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-11-23 02:20:22,716 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,717 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,717 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,717 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,717 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,717 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-11-23 02:20:22,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,718 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-11-23 02:20:22,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,719 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,720 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-11-23 02:20:22,721 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (!(i + 1 <= v_ULTIMATE.start_main_~i~0#1_216) || v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4]) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 5 <= unknown-#memory_int-unknown[a][a + 20]) && (!(i < SIZE) || i < unknown-#memory_int-unknown[a][a + i * 4] + 1)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) && (i < unknown-#memory_int-unknown[a][a + i * 4 + 4] || !(i + 1 < SIZE))) || ((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || ((3 <= i && (((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12]) || ((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0))) && SIZE <= 5)) || ((((i <= 2 && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 3 + i) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && (((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12]) || ((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0))) && 5 <= unknown-#memory_int-unknown[a][a + 20])) || ((((SIZE <= 2 && a == 0) && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) || (((((((\exists v_ULTIMATE.start_main_~i~0#1_55 : int :: (!(v_ULTIMATE.start_main_~i~0#1_55 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_55 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_55 * 4]) && v_ULTIMATE.start_main_~i~0#1_55 <= 2) && a == 0) && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || (((((((((a == 0 && 1 <= i) && cond == 1) && i <= 2) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && unknown-#memory_int-unknown[a][0] == 0)) || (((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && (\exists ULTIMATE.start_main_~i~0#1 : int :: (ULTIMATE.start_main_~i~0#1 <= 3 && !(ULTIMATE.start_main_~i~0#1 + 1 < SIZE)) && ULTIMATE.start_main_~i~0#1 <= unknown-#memory_int-unknown[a][a + ULTIMATE.start_main_~i~0#1 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8])) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= i) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || (((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 2 + i <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8])) && 1 <= i) && SIZE <= 5)) || (((((((((a == 0 && 1 <= i) && cond == 1) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && (\exists v_ULTIMATE.start_main_~i~0#1_83 : int :: (!(v_ULTIMATE.start_main_~i~0#1_83 + 1 < SIZE) && v_ULTIMATE.start_main_~i~0#1_83 <= 3) && v_ULTIMATE.start_main_~i~0#1_83 <= unknown-#memory_int-unknown[a][a + v_ULTIMATE.start_main_~i~0#1_83 * 4])) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((((a == 0 && 1 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 8 == i * 4) && !(i + 1 < SIZE)) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) || (((((SIZE <= 2 && a == 0) && 1 <= i) && !(cond == 0)) && 2 <= i) && unknown-#memory_int-unknown[a][0] == 0)) || ((((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && 3 == i) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 2 + i) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 5 <= unknown-#memory_int-unknown[a][a + 20])) || ((((((((((((a == 0 && 1 <= i) && 3 <= i) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && a + i * 4 <= 12) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0) || (((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && i == 4) && 3 <= unknown-#memory_int-unknown[a][12]) && 3 <= i) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && 2 <= unknown-#memory_int-unknown[a][a + 8]) && unknown-#memory_int-unknown[a][0] == 0)) && SIZE <= 5) && 4 <= i)) || ((((((((((a == 0 && 1 <= i) && i <= 2) && !(cond == 0)) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && 2 <= i) && SIZE <= 5) && i <= unknown-#memory_int-unknown[a][a + i * 4]) && unknown-#memory_int-unknown[a][0] == 0) && i + 1 <= unknown-#memory_int-unknown[a][12])) || (((((((i == 0 && ((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0))) && 3 <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8]) || (((((((((((a == 0 && 1 <= i) && i == 1) && !(cond == 0)) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][0] == 0) || (((a == 0 && i == 0) && 1 <= unknown-#memory_int-unknown[a][a + 4]) && unknown-#memory_int-unknown[a][a + i * 4] == 0)) && cond == 1) && i == 1) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 2 + i <= unknown-#memory_int-unknown[a][12]) && 2 <= unknown-#memory_int-unknown[a][a + 8])) && (forall v_ULTIMATE.start_main_~i~0#1_216 : int :: (v_ULTIMATE.start_main_~i~0#1_216 < unknown-#memory_int-unknown[a][v_ULTIMATE.start_main_~i~0#1_216 * 4 + a + 4] || v_ULTIMATE.start_main_~i~0#1_216 < 5) || !(v_ULTIMATE.start_main_~i~0#1_216 + 1 < SIZE))) && 4 <= unknown-#memory_int-unknown[a][a + 16]) && 5 <= unknown-#memory_int-unknown[a][a + 20]) RESULT: Ultimate proved your program to be correct! [2022-11-23 02:20:22,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7421c748-ce24-4edd-9f4f-697e5b73b6ba/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE