./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-tiling/rewnif.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2329fc7 [2022-12-13 18:50:38,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:50:38,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:50:38,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:50:38,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:50:38,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:50:38,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:50:38,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:50:38,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:50:38,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:50:38,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:50:38,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:50:38,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:50:38,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:50:38,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:50:38,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:50:38,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:50:38,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:50:38,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:50:38,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:50:38,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:50:38,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:50:38,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:50:38,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:50:38,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:50:38,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:50:38,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:50:38,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:50:38,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:50:38,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:50:38,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:50:38,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:50:38,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:50:38,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:50:38,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:50:38,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:50:38,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:50:38,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:50:38,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:50:38,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:50:38,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:50:38,661 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 18:50:38,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:50:38,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:50:38,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:50:38,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:50:38,684 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:50:38,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:50:38,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:50:38,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:50:38,686 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:50:38,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:50:38,686 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:50:38,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:50:38,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:50:38,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:50:38,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:50:38,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:50:38,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:50:38,687 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:50:38,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:50:38,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:50:38,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:50:38,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:50:38,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:50:38,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:50:38,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:50:38,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:50:38,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:50:38,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:50:38,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:50:38,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:50:38,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:50:38,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:50:38,690 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:50:38,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:50:38,690 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:50:38,691 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_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ee21d1db2a363655b71bcb8ab92ef8d6b86a57a4ebbd79d98cb55c59d3ed1f5 [2022-12-13 18:50:38,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:50:38,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:50:38,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:50:38,879 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:50:38,879 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:50:38,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-tiling/rewnif.c [2022-12-13 18:50:41,517 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:50:41,658 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:50:41,658 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/sv-benchmarks/c/array-tiling/rewnif.c [2022-12-13 18:50:41,663 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/data/e06e4651d/2549d251897c4ae696be384330648022/FLAG5b3d0d9b6 [2022-12-13 18:50:41,673 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/data/e06e4651d/2549d251897c4ae696be384330648022 [2022-12-13 18:50:41,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:50:41,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:50:41,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:50:41,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:50:41,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:50:41,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507117a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41, skipping insertion in model container [2022-12-13 18:50:41,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:50:41,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:50:41,808 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_baf93e62-8221-46f6-a303-e606478fef9e/sv-benchmarks/c/array-tiling/rewnif.c[397,410] [2022-12-13 18:50:41,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:50:41,828 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:50:41,837 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_baf93e62-8221-46f6-a303-e606478fef9e/sv-benchmarks/c/array-tiling/rewnif.c[397,410] [2022-12-13 18:50:41,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:50:41,853 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:50:41,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41 WrapperNode [2022-12-13 18:50:41,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:50:41,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:50:41,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:50:41,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:50:41,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,878 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-12-13 18:50:41,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:50:41,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:50:41,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:50:41,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:50:41,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,896 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:50:41,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:50:41,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:50:41,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:50:41,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (1/1) ... [2022-12-13 18:50:41,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:50:41,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:41,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:50:41,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:50:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:50:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:50:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:50:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 18:50:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:50:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:50:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:50:42,003 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:50:42,005 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:50:42,106 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:50:42,112 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:50:42,112 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 18:50:42,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:50:42 BoogieIcfgContainer [2022-12-13 18:50:42,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:50:42,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:50:42,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:50:42,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:50:42,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:50:41" (1/3) ... [2022-12-13 18:50:42,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7c1344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:50:42, skipping insertion in model container [2022-12-13 18:50:42,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:50:41" (2/3) ... [2022-12-13 18:50:42,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7c1344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:50:42, skipping insertion in model container [2022-12-13 18:50:42,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:50:42" (3/3) ... [2022-12-13 18:50:42,123 INFO L112 eAbstractionObserver]: Analyzing ICFG rewnif.c [2022-12-13 18:50:42,143 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:50:42,143 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 18:50:42,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:50:42,198 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;@4546da0f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:50:42,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 18:50:42,203 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-12-13 18:50:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 18:50:42,209 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:42,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:42,210 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash 133671584, now seen corresponding path program 1 times [2022-12-13 18:50:42,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:42,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264156647] [2022-12-13 18:50:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:42,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:42,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264156647] [2022-12-13 18:50:42,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264156647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:50:42,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:50:42,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:50:42,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189719327] [2022-12-13 18:50:42,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:50:42,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 18:50:42,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:50:42,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:50:42,393 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-12-13 18:50:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:42,405 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-12-13 18:50:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:50:42,406 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-12-13 18:50:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:42,412 INFO L225 Difference]: With dead ends: 29 [2022-12-13 18:50:42,412 INFO L226 Difference]: Without dead ends: 14 [2022-12-13 18:50:42,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:50:42,417 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-12-13 18:50:42,418 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-12-13 18:50:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-13 18:50:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-12-13 18:50:42,441 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-12-13 18:50:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-12-13 18:50:42,442 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2022-12-13 18:50:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:42,443 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-12-13 18:50:42,443 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-12-13 18:50:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-12-13 18:50:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 18:50:42,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:42,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:42,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:50:42,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 121665811, now seen corresponding path program 1 times [2022-12-13 18:50:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:42,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929744130] [2022-12-13 18:50:42,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:42,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:42,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:42,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929744130] [2022-12-13 18:50:42,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929744130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:50:42,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:50:42,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:50:42,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118305273] [2022-12-13 18:50:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:50:42,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:50:42,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:50:42,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:50:42,534 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-12-13 18:50:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:42,579 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-12-13 18:50:42,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:50:42,580 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-12-13 18:50:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:42,580 INFO L225 Difference]: With dead ends: 29 [2022-12-13 18:50:42,580 INFO L226 Difference]: Without dead ends: 18 [2022-12-13 18:50:42,581 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-12-13 18:50:42,582 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-12-13 18:50:42,583 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-12-13 18:50:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-13 18:50:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-12-13 18:50:42,587 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-12-13 18:50:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-12-13 18:50:42,587 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2022-12-13 18:50:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:42,588 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-12-13 18:50:42,588 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-12-13 18:50:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-12-13 18:50:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 18:50:42,588 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:42,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:42,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:50:42,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash 729197006, now seen corresponding path program 1 times [2022-12-13 18:50:42,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:42,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666041908] [2022-12-13 18:50:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:42,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:42,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:42,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666041908] [2022-12-13 18:50:42,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666041908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:42,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159482105] [2022-12-13 18:50:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:42,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:42,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:42,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:42,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 18:50:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:42,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:50:42,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:42,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:42,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159482105] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:42,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:42,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 18:50:42,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285100159] [2022-12-13 18:50:42,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:42,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:50:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:42,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:50:42,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:50:42,832 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-12-13 18:50:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:42,882 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-12-13 18:50:42,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:50:42,883 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-12-13 18:50:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:42,884 INFO L225 Difference]: With dead ends: 34 [2022-12-13 18:50:42,884 INFO L226 Difference]: Without dead ends: 27 [2022-12-13 18:50:42,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:50:42,885 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:42,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:50:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-13 18:50:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-12-13 18:50:42,890 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-12-13 18:50:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-12-13 18:50:42,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-12-13 18:50:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:42,891 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-12-13 18:50:42,891 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-12-13 18:50:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-12-13 18:50:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 18:50:42,892 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:42,892 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:42,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:50:43,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:43,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1021157689, now seen corresponding path program 1 times [2022-12-13 18:50:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:43,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130239185] [2022-12-13 18:50:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:43,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:43,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130239185] [2022-12-13 18:50:43,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130239185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:43,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004725024] [2022-12-13 18:50:43,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:43,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:43,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:43,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:43,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 18:50:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:43,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 18:50:43,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:43,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-12-13 18:50:43,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:50:43,652 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-12-13 18:50:43,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:50:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:43,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:43,852 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-12-13 18:50:43,859 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-12-13 18:50:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:43,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004725024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:43,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:43,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2022-12-13 18:50:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014260267] [2022-12-13 18:50:43,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:43,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 18:50:43,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:43,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 18:50:43,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:50:43,927 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-12-13 18:50:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:44,078 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-12-13 18:50:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:50:44,079 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-12-13 18:50:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:44,079 INFO L225 Difference]: With dead ends: 28 [2022-12-13 18:50:44,079 INFO L226 Difference]: Without dead ends: 26 [2022-12-13 18:50:44,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-12-13 18:50:44,080 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:44,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 40 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:50:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-13 18:50:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-12-13 18:50:44,083 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-12-13 18:50:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-12-13 18:50:44,083 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2022-12-13 18:50:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:44,084 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-12-13 18:50:44,084 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-12-13 18:50:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-12-13 18:50:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 18:50:44,084 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:44,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:44,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 18:50:44,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:44,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1566850755, now seen corresponding path program 1 times [2022-12-13 18:50:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:44,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10252849] [2022-12-13 18:50:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:44,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:44,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10252849] [2022-12-13 18:50:44,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10252849] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:44,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694186950] [2022-12-13 18:50:44,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:44,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:44,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:44,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:44,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 18:50:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:44,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 18:50:44,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:44,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 18:50:44,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:50:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:44,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:44,777 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-12-13 18:50:44,780 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-12-13 18:50:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:44,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694186950] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:44,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:44,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-12-13 18:50:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979442819] [2022-12-13 18:50:44,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:44,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 18:50:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 18:50:44,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:50:44,800 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-12-13 18:50:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:44,998 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-12-13 18:50:44,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 18:50:44,999 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-12-13 18:50:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:44,999 INFO L225 Difference]: With dead ends: 60 [2022-12-13 18:50:44,999 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 18:50:45,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-12-13 18:50:45,000 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:45,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 105 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:50:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 18:50:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2022-12-13 18:50:45,005 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-12-13 18:50:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-12-13 18:50:45,005 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 20 [2022-12-13 18:50:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:45,005 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-12-13 18:50:45,005 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-12-13 18:50:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-12-13 18:50:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 18:50:45,006 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:45,006 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:45,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 18:50:45,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:45,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1995245389, now seen corresponding path program 2 times [2022-12-13 18:50:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:45,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508023607] [2022-12-13 18:50:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:45,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:45,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508023607] [2022-12-13 18:50:45,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508023607] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:45,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409803532] [2022-12-13 18:50:45,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:50:45,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:45,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:45,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:45,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 18:50:45,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:50:45,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:50:45,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:50:45,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:45,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:45,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409803532] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:45,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:45,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-12-13 18:50:45,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046258626] [2022-12-13 18:50:45,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:45,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 18:50:45,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:45,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 18:50:45,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-13 18:50:45,538 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-12-13 18:50:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:45,614 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-12-13 18:50:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 18:50:45,615 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-12-13 18:50:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:45,615 INFO L225 Difference]: With dead ends: 85 [2022-12-13 18:50:45,615 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 18:50:45,615 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-12-13 18:50:45,616 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:45,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 40 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:50:45,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 18:50:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-12-13 18:50:45,620 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-12-13 18:50:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-12-13 18:50:45,620 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2022-12-13 18:50:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:45,620 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-12-13 18:50:45,620 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-12-13 18:50:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-12-13 18:50:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 18:50:45,621 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:45,621 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:45,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 18:50:45,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:45,822 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1364521933, now seen corresponding path program 3 times [2022-12-13 18:50:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:45,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418347590] [2022-12-13 18:50:45,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:45,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:46,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:46,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418347590] [2022-12-13 18:50:46,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418347590] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:46,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521397568] [2022-12-13 18:50:46,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:50:46,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:46,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:46,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:46,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 18:50:46,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 18:50:46,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:50:46,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 18:50:46,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:46,321 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-12-13 18:50:46,369 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-12-13 18:50:46,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-12-13 18:50:46,413 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-12-13 18:50:46,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:50:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:46,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:46,686 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-12-13 18:50:46,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 131 [2022-12-13 18:50:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:46,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521397568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:46,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:46,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 23 [2022-12-13 18:50:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292423927] [2022-12-13 18:50:46,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:46,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 18:50:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 18:50:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-12-13 18:50:46,721 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-12-13 18:50:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:46,989 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-12-13 18:50:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 18:50:46,989 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-12-13 18:50:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:46,990 INFO L225 Difference]: With dead ends: 67 [2022-12-13 18:50:46,990 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 18:50:46,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2022-12-13 18:50:46,991 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 121 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:46,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 98 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:50:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 18:50:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 29. [2022-12-13 18:50:46,994 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-12-13 18:50:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-12-13 18:50:46,995 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2022-12-13 18:50:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:46,995 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-12-13 18:50:46,995 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-12-13 18:50:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-12-13 18:50:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 18:50:46,995 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:46,996 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:47,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 18:50:47,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:47,197 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1191072622, now seen corresponding path program 4 times [2022-12-13 18:50:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:47,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841542652] [2022-12-13 18:50:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841542652] [2022-12-13 18:50:47,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841542652] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387298498] [2022-12-13 18:50:47,488 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:50:47,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:47,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:47,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:47,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 18:50:47,546 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:50:47,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:50:47,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 18:50:47,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:47,597 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-12-13 18:50:47,795 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 18:50:47,795 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-12-13 18:50:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:47,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:47,991 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-12-13 18:50:47,996 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-12-13 18:50:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:48,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387298498] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:48,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:48,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-12-13 18:50:48,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30432838] [2022-12-13 18:50:48,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:48,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 18:50:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 18:50:48,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-12-13 18:50:48,065 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-12-13 18:50:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:48,924 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-12-13 18:50:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 18:50:48,925 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-12-13 18:50:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:48,925 INFO L225 Difference]: With dead ends: 87 [2022-12-13 18:50:48,926 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 18:50:48,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=2340, Unknown=0, NotChecked=0, Total=2756 [2022-12-13 18:50:48,927 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 109 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:48,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 154 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:50:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 18:50:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2022-12-13 18:50:48,936 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-12-13 18:50:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-12-13 18:50:48,937 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 28 [2022-12-13 18:50:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:48,937 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-12-13 18:50:48,938 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-12-13 18:50:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-12-13 18:50:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 18:50:48,938 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:48,938 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:48,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 18:50:49,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:49,139 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash 367413348, now seen corresponding path program 5 times [2022-12-13 18:50:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:49,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144048641] [2022-12-13 18:50:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:49,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144048641] [2022-12-13 18:50:49,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144048641] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:49,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125422516] [2022-12-13 18:50:49,425 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 18:50:49,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:49,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:49,425 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:49,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 18:50:49,493 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 18:50:49,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:50:49,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 18:50:49,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:49,542 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-12-13 18:50:49,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:50:49,589 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-12-13 18:50:49,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:50:49,598 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-12-13 18:50:49,630 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-12-13 18:50:49,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:50:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:49,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:49,962 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-12-13 18:50:49,966 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-12-13 18:50:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:50,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125422516] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:50,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:50,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 29 [2022-12-13 18:50:50,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393059638] [2022-12-13 18:50:50,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:50,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 18:50:50,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:50,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 18:50:50,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2022-12-13 18:50:50,020 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-12-13 18:50:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:50,481 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-12-13 18:50:50,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 18:50:50,482 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-12-13 18:50:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:50,483 INFO L225 Difference]: With dead ends: 79 [2022-12-13 18:50:50,483 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 18:50:50,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=353, Invalid=1903, Unknown=0, NotChecked=0, Total=2256 [2022-12-13 18:50:50,484 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 92 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:50,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 166 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:50:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 18:50:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 37. [2022-12-13 18:50:50,489 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-12-13 18:50:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-12-13 18:50:50,489 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2022-12-13 18:50:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:50,489 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-12-13 18:50:50,489 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-12-13 18:50:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-12-13 18:50:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 18:50:50,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:50,490 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:50,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 18:50:50,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:50,691 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash 947747359, now seen corresponding path program 6 times [2022-12-13 18:50:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:50,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437000428] [2022-12-13 18:50:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:50,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:50,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437000428] [2022-12-13 18:50:50,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437000428] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:50,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574076272] [2022-12-13 18:50:50,958 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 18:50:50,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:50,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:50,959 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:50,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 18:50:51,018 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-13 18:50:51,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:50:51,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 18:50:51,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:51,078 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-12-13 18:50:51,367 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 18:50:51,367 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-12-13 18:50:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:51,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:51,684 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-12-13 18:50:51,687 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-12-13 18:50:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:51,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574076272] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:51,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:51,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 31 [2022-12-13 18:50:51,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069906272] [2022-12-13 18:50:51,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:51,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 18:50:51,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:51,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 18:50:51,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-12-13 18:50:51,776 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-12-13 18:50:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:53,391 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-12-13 18:50:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 18:50:53,391 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-12-13 18:50:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:53,392 INFO L225 Difference]: With dead ends: 103 [2022-12-13 18:50:53,392 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 18:50:53,393 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-12-13 18:50:53,394 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 120 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:53,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 155 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:50:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 18:50:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2022-12-13 18:50:53,405 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-12-13 18:50:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-12-13 18:50:53,405 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 36 [2022-12-13 18:50:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:53,406 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-12-13 18:50:53,406 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-12-13 18:50:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-12-13 18:50:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 18:50:53,407 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:53,407 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:53,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 18:50:53,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:53,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash -470542059, now seen corresponding path program 7 times [2022-12-13 18:50:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:53,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274332182] [2022-12-13 18:50:53,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274332182] [2022-12-13 18:50:54,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274332182] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234903991] [2022-12-13 18:50:54,105 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 18:50:54,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:54,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:54,106 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:54,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 18:50:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:54,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 18:50:54,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:54,216 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-12-13 18:50:54,263 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-12-13 18:50:54,274 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-12-13 18:50:54,326 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-12-13 18:50:54,450 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-12-13 18:50:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:54,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:54,759 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-12-13 18:50:54,762 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-12-13 18:50:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:55,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234903991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:55,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:55,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 32 [2022-12-13 18:50:55,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401887322] [2022-12-13 18:50:55,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:55,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 18:50:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:55,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 18:50:55,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2022-12-13 18:50:55,064 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-12-13 18:50:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:55,509 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-12-13 18:50:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 18:50:55,509 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-12-13 18:50:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:55,510 INFO L225 Difference]: With dead ends: 91 [2022-12-13 18:50:55,510 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 18:50:55,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=1844, Unknown=0, NotChecked=0, Total=2162 [2022-12-13 18:50:55,512 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 91 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:55,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 205 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:50:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 18:50:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 45. [2022-12-13 18:50:55,520 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-12-13 18:50:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-12-13 18:50:55,520 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2022-12-13 18:50:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:55,520 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-12-13 18:50:55,520 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-12-13 18:50:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-12-13 18:50:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 18:50:55,521 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:55,521 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:55,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 18:50:55,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 18:50:55,722 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1613367984, now seen corresponding path program 8 times [2022-12-13 18:50:55,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:55,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313858778] [2022-12-13 18:50:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:56,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:56,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313858778] [2022-12-13 18:50:56,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313858778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:56,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600952030] [2022-12-13 18:50:56,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:50:56,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:56,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:56,004 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:56,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 18:50:56,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:50:56,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:50:56,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 18:50:56,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:56,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 18:50:56,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 18:50:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:56,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:56,444 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-12-13 18:50:56,446 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-12-13 18:50:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:56,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600952030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:56,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:56,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-12-13 18:50:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224863618] [2022-12-13 18:50:56,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 18:50:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 18:50:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2022-12-13 18:50:56,483 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-12-13 18:50:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:56,874 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-12-13 18:50:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 18:50:56,875 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-12-13 18:50:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:56,875 INFO L225 Difference]: With dead ends: 96 [2022-12-13 18:50:56,875 INFO L226 Difference]: Without dead ends: 94 [2022-12-13 18:50:56,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1930, Unknown=0, NotChecked=0, Total=2162 [2022-12-13 18:50:56,876 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 66 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:56,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 256 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:50:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-13 18:50:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2022-12-13 18:50:56,886 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-12-13 18:50:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-12-13 18:50:56,886 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 44 [2022-12-13 18:50:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:56,887 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-12-13 18:50:56,887 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-12-13 18:50:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-12-13 18:50:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 18:50:56,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:56,888 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:56,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 18:50:57,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:57,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:57,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash 924773190, now seen corresponding path program 9 times [2022-12-13 18:50:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:57,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392756022] [2022-12-13 18:50:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:57,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:57,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392756022] [2022-12-13 18:50:57,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392756022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:57,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102860887] [2022-12-13 18:50:57,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:50:57,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:57,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:57,249 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:57,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 18:50:57,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 18:50:57,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:50:57,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 18:50:57,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:57,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 50 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:57,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102860887] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:57,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:57,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2022-12-13 18:50:57,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215775169] [2022-12-13 18:50:57,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:57,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 18:50:57,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:57,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 18:50:57,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-12-13 18:50:57,534 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-12-13 18:50:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:57,683 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2022-12-13 18:50:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 18:50:57,684 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-12-13 18:50:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:57,684 INFO L225 Difference]: With dead ends: 114 [2022-12-13 18:50:57,685 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 18:50:57,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2022-12-13 18:50:57,685 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:57,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 90 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:50:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 18:50:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2022-12-13 18:50:57,698 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-12-13 18:50:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-12-13 18:50:57,699 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 48 [2022-12-13 18:50:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:57,699 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-12-13 18:50:57,699 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-12-13 18:50:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-12-13 18:50:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 18:50:57,700 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:57,700 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:57,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 18:50:57,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:57,901 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash 730938950, now seen corresponding path program 10 times [2022-12-13 18:50:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:57,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991291282] [2022-12-13 18:50:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:50:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:50:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:58,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:50:58,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991291282] [2022-12-13 18:50:58,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991291282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:50:58,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634027417] [2022-12-13 18:50:58,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:50:58,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:50:58,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:50:58,397 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:50:58,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 18:50:58,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:50:58,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:50:58,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 18:50:58,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:50:58,581 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-12-13 18:50:58,628 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 18:50:58,628 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-12-13 18:50:58,641 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 18:50:58,641 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-12-13 18:50:58,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:50:58,699 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-12-13 18:50:58,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:50:58,888 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-12-13 18:50:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:58,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:50:59,107 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-12-13 18:50:59,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2022-12-13 18:50:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:50:59,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634027417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:50:59,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:50:59,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 37 [2022-12-13 18:50:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901149632] [2022-12-13 18:50:59,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:50:59,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 18:50:59,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:50:59,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 18:50:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 18:50:59,251 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-12-13 18:50:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:50:59,749 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-12-13 18:50:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 18:50:59,749 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-12-13 18:50:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:50:59,750 INFO L225 Difference]: With dead ends: 101 [2022-12-13 18:50:59,750 INFO L226 Difference]: Without dead ends: 99 [2022-12-13 18:50:59,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=393, Invalid=2469, Unknown=0, NotChecked=0, Total=2862 [2022-12-13 18:50:59,752 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 87 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:50:59,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 245 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:50:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-13 18:50:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2022-12-13 18:50:59,763 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-12-13 18:50:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-12-13 18:50:59,764 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2022-12-13 18:50:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:50:59,764 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-12-13 18:50:59,764 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-12-13 18:50:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-12-13 18:50:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-13 18:50:59,764 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:50:59,764 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:50:59,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 18:50:59,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 18:50:59,966 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:50:59,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:50:59,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1215546761, now seen corresponding path program 11 times [2022-12-13 18:50:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:50:59,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842970298] [2022-12-13 18:50:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:50:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:51:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:51:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 51 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:51:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:51:00,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842970298] [2022-12-13 18:51:00,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842970298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:51:00,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871004158] [2022-12-13 18:51:00,134 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 18:51:00,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:51:00,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:51:00,135 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:51:00,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 18:51:00,268 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-12-13 18:51:00,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:51:00,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 18:51:00,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:51:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 72 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:51:00,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:51:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 72 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:51:00,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871004158] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:51:00,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:51:00,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2022-12-13 18:51:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446991438] [2022-12-13 18:51:00,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:51:00,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 18:51:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:51:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 18:51:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-12-13 18:51:00,556 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-12-13 18:51:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:51:00,698 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-12-13 18:51:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 18:51:00,699 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-12-13 18:51:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:51:00,699 INFO L225 Difference]: With dead ends: 100 [2022-12-13 18:51:00,699 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 18:51:00,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 90 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2022-12-13 18:51:00,700 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:51:00,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 126 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:51:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 18:51:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-12-13 18:51:00,708 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-12-13 18:51:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-12-13 18:51:00,708 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2022-12-13 18:51:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:51:00,709 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-12-13 18:51:00,709 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-12-13 18:51:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-12-13 18:51:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 18:51:00,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:51:00,710 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:51:00,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 18:51:00,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 18:51:00,911 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:51:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:51:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash -836376270, now seen corresponding path program 12 times [2022-12-13 18:51:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:51:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609158227] [2022-12-13 18:51:00,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:51:00,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:51:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:51:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:51:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:51:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609158227] [2022-12-13 18:51:01,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609158227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:51:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072082257] [2022-12-13 18:51:01,275 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 18:51:01,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:51:01,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:51:01,276 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:51:01,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 18:51:01,493 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-12-13 18:51:01,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:51:01,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 18:51:01,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:51:01,588 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-12-13 18:51:01,716 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-13 18:51:01,716 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-12-13 18:51:02,587 INFO L321 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2022-12-13 18:51:02,588 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-12-13 18:51:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 62 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:51:02,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:51:07,761 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-12-13 18:51:07,765 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-12-13 18:51:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 39 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:51:07,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072082257] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:51:07,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:51:07,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 51 [2022-12-13 18:51:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137884060] [2022-12-13 18:51:07,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:51:07,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 18:51:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:51:07,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 18:51:07,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=2224, Unknown=1, NotChecked=0, Total=2550 [2022-12-13 18:51:07,921 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-12-13 18:51:26,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:51:28,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:51:50,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:51:54,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 18:52:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:52:28,399 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-12-13 18:52:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-12-13 18:52:28,399 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-12-13 18:52:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:52:28,400 INFO L225 Difference]: With dead ends: 137 [2022-12-13 18:52:28,400 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 18:52:28,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3920 ImplicationChecksByTransitivity, 77.6s TimeCoverageRelationStatistics Valid=1918, Invalid=13072, Unknown=16, NotChecked=0, Total=15006 [2022-12-13 18:52:28,402 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 444 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 165 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:52:28,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 223 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1258 Invalid, 3 Unknown, 0 Unchecked, 8.6s Time] [2022-12-13 18:52:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 18:52:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 18:52:28,403 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-12-13 18:52:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 18:52:28,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2022-12-13 18:52:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:52:28,403 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 18:52:28,403 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-12-13 18:52:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 18:52:28,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 18:52:28,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 18:52:28,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 18:52:28,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 18:52:28,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 18:56:46,733 WARN L233 SmtUtils]: Spent 4.30m on a formula simplification. DAG size of input: 383 DAG size of output: 382 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 18:57:31,280 WARN L233 SmtUtils]: Spent 43.95s on a formula simplification. DAG size of input: 382 DAG size of output: 185 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 18:57:32,370 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 37) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point L19-1(lines 19 37) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 16 39) the Hoare annotation is: true [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point L24-2(lines 24 31) no Hoare annotation was computed. [2022-12-13 18:57:32,371 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-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point L24-4(lines 24 31) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point L8-3(line 8) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 18:57:32,371 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 33 36) no Hoare annotation was computed. [2022-12-13 18:57:32,372 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 36) the Hoare annotation is: (let ((.cse30 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse9 (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse26 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse30))) (let ((.cse37 (select .cse9 .cse26))) (let ((.cse36 (select .cse9 12)) (.cse38 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse17 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse18 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) (.cse19 (= (select .cse9 0) 0)) (.cse13 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_main_~i~0#1| 0)) (.cse15 (<= 1 (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (.cse16 (= .cse37 0))) (let ((.cse0 (or (and .cse13 .cse17 .cse2 .cse18 .cse15 .cse19) (and .cse13 .cse14 .cse15 .cse16))) (.cse1 (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1)) (.cse34 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse31 (not (< .cse38 ~SIZE~0))) (.cse23 (<= (+ (div (- |ULTIMATE.start_main_~a~0#1.offset|) 4) 4) |ULTIMATE.start_main_~i~0#1|)) (.cse20 (<= 3 .cse36)) (.cse8 (<= |ULTIMATE.start_main_~i~0#1| 2)) (.cse35 (<= .cse38 .cse36)) (.cse5 (<= 3 |ULTIMATE.start_main_~i~0#1|)) (.cse10 (<= 4 (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| 16)))) (.cse21 (<= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse39 (<= .cse26 12)) (.cse22 (<= |ULTIMATE.start_main_~i~0#1| .cse37)) (.cse4 (<= 2 (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))))) (let ((.cse6 (or (and .cse13 .cse17 .cse8 .cse18 .cse15 .cse21 .cse22 .cse19 .cse35) (and .cse13 .cse17 .cse5 .cse18 .cse10 .cse15 .cse21 .cse39 .cse22 .cse4 .cse19))) (.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 .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))))) (.cse12 (<= ~SIZE~0 2)) (.cse32 (or (and .cse13 .cse17 .cse5 .cse18 .cse15 .cse21 .cse39 .cse22 .cse4 .cse19) (and .cse23 .cse13 .cse17 (= |ULTIMATE.start_main_~i~0#1| 4) .cse20 .cse5 .cse18 .cse10 .cse15 .cse21 .cse4 .cse19))) (.cse33 (<= 4 |ULTIMATE.start_main_~i~0#1|)) (.cse24 (<= 5 |ULTIMATE.start_main_~i~0#1|)) (.cse27 (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= .cse38 |v_ULTIMATE.start_main_~i~0#1_216|)) (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse9 (+ (* |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))))) (.cse28 (or (not (< |ULTIMATE.start_main_~i~0#1| ~SIZE~0)) (< |ULTIMATE.start_main_~i~0#1| (+ .cse37 1)))) (.cse29 (or (< |ULTIMATE.start_main_~i~0#1| (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse30 4))) .cse31)) (.cse7 (<= ~SIZE~0 5)) (.cse25 (or (and .cse14 .cse0 .cse20 .cse4) (and .cse0 .cse1 .cse2 .cse10 (<= .cse34 .cse36) .cse4))) (.cse11 (<= 5 (select .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| 20))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse8 (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse9 (+ (* |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)))) .cse10 .cse6 .cse11) (and .cse12 .cse13 .cse14 .cse15 .cse16) (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 .cse9 (+ |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))) .cse13 .cse17 .cse2 .cse18 .cse15 .cse19) (and .cse14 .cse0 .cse20 .cse10 .cse7 .cse4) (and .cse13 .cse17 .cse1 .cse8 .cse18 .cse15 .cse21 .cse22 .cse3 .cse19) (and .cse14 .cse0 (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 .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) .cse4) (and .cse23 .cse13 .cse17 .cse24 .cse20 .cse5 .cse18 .cse15 .cse21 .cse7 .cse4 .cse19) (and .cse25 .cse17 .cse7) (and .cse13 .cse17 .cse1 .cse5 .cse18 .cse15 .cse21 .cse3 .cse4 .cse19) (and .cse23 .cse13 .cse17 (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 .cse9 .cse26 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)))) .cse1 .cse24 .cse20 .cse5 .cse18 .cse10 .cse15 .cse21 .cse27 .cse11 .cse28 .cse4 .cse19 .cse29) (and .cse13 .cse17 .cse18 .cse15 .cse21 (= 8 .cse30) .cse31 .cse4 .cse19) (and .cse12 .cse13 .cse17 .cse18 .cse21 .cse19) (and .cse32 .cse27 .cse11 .cse33) (and .cse23 .cse13 .cse17 .cse24 .cse20 .cse5 .cse18 .cse10 .cse15 (<= ~SIZE~0 6) .cse21 .cse11 .cse4 .cse19 (<= 6 |ULTIMATE.start_main_~i~0#1|)) (and .cse32 (= 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 .cse9 (+ (* |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| .cse34) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_216| 1) ~SIZE~0)))) .cse10 .cse11) (and .cse32 .cse7 .cse33) (and .cse23 .cse13 .cse17 .cse24 .cse20 .cse5 .cse18 .cse10 .cse15 .cse21 .cse27 .cse11 (= .cse30 24) .cse28 .cse4 .cse19 .cse29) (and .cse13 .cse17 .cse8 .cse18 .cse10 .cse15 .cse21 .cse7 .cse22 .cse19 .cse35) (and .cse25 (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_216| (select .cse9 (+ (* |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)))) .cse10 .cse11)))))))) [2022-12-13 18:57:32,372 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 18:57:32,372 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 29) no Hoare annotation was computed. [2022-12-13 18:57:32,372 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 29) no Hoare annotation was computed. [2022-12-13 18:57:32,374 INFO L445 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1, 1] [2022-12-13 18:57:32,376 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:57:32,382 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,393 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,396 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,410 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:57:32 BoogieIcfgContainer [2022-12-13 18:57:32,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:57:32,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:57:32,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:57:32,430 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:57:32,430 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:50:42" (3/4) ... [2022-12-13 18:57:32,432 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 18:57:32,439 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-12-13 18:57:32,439 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 18:57:32,439 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 18:57:32,439 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 18:57:32,456 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-12-13 18:57:32,456 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((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 / 4 + 4 <= i && a == 0) && 1 <= i) && (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)) && cond == 1) && 5 <= 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) && !(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)) && (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]) && 4 <= i)) || ((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= 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]) && 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) && 6 <= i)) || ((((((((((((((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 / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= 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 * 4 == 24) && (!(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 <= 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-12-13 18:57:32,460 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:57:32,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:57:32,461 INFO L158 Benchmark]: Toolchain (without parser) took 410784.42ms. Allocated memory was 130.0MB in the beginning and 610.3MB in the end (delta: 480.2MB). Free memory was 101.2MB in the beginning and 363.3MB in the end (delta: -262.1MB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. [2022-12-13 18:57:32,461 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:57:32,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.63ms. Allocated memory is still 130.0MB. Free memory was 101.2MB in the beginning and 90.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 18:57:32,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.08ms. Allocated memory is still 130.0MB. Free memory was 90.7MB in the beginning and 89.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:57:32,461 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 130.0MB. Free memory was 89.1MB in the beginning and 88.2MB in the end (delta: 866.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:57:32,462 INFO L158 Benchmark]: RCFGBuilder took 216.01ms. Allocated memory is still 130.0MB. Free memory was 87.9MB in the beginning and 77.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 18:57:32,462 INFO L158 Benchmark]: TraceAbstraction took 410311.78ms. Allocated memory was 130.0MB in the beginning and 610.3MB in the end (delta: 480.2MB). Free memory was 77.1MB in the beginning and 365.4MB in the end (delta: -288.3MB). Peak memory consumption was 346.5MB. Max. memory is 16.1GB. [2022-12-13 18:57:32,462 INFO L158 Benchmark]: Witness Printer took 31.09ms. Allocated memory is still 610.3MB. Free memory was 365.4MB in the beginning and 363.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:57:32,464 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.12ms. Allocated memory is still 130.0MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.63ms. Allocated memory is still 130.0MB. Free memory was 101.2MB in the beginning and 90.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.08ms. Allocated memory is still 130.0MB. Free memory was 90.7MB in the beginning and 89.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 130.0MB. Free memory was 89.1MB in the beginning and 88.2MB in the end (delta: 866.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 216.01ms. Allocated memory is still 130.0MB. Free memory was 87.9MB in the beginning and 77.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 410311.78ms. Allocated memory was 130.0MB in the beginning and 610.3MB in the end (delta: 480.2MB). Free memory was 77.1MB in the beginning and 365.4MB in the end (delta: -288.3MB). Peak memory consumption was 346.5MB. Max. memory is 16.1GB. * Witness Printer took 31.09ms. Allocated memory is still 610.3MB. Free memory was 365.4MB in the beginning and 363.3MB 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_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_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_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_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_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_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_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: 410.2s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 85.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 303.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 1393 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1393 mSDsluCounter, 1962 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1722 mSDsCounter, 513 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6134 IncrementalHoareTripleChecker+Invalid, 6650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 513 mSolverCounterUnsat, 240 mSDtfsCounter, 6134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1413 GetRequests, 766 SyntacticMatches, 72 SemanticMatches, 575 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9652 ImplicationChecksByTransitivity, 83.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=12, InterpolantAutomatonStates: 409, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 317 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 69 NumberOfFragments, 2926 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1453 FormulaSimplificationTreeSizeReduction, 258.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 37292050 FormulaSimplificationTreeSizeReductionInter, 45.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.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-12-13 18:57:32,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,472 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,476 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,476 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,476 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-12-13 18:57:32,477 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,478 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,479 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,479 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,479 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,479 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,479 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,479 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,479 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,480 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,489 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,489 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,489 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,489 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,489 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,489 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,490 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,490 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,490 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,490 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,490 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,490 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_55,QUANTIFIED] [2022-12-13 18:57:32,490 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0#1,QUANTIFIED] [2022-12-13 18:57:32,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_83,QUANTIFIED] [2022-12-13 18:57:32,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_528,QUANTIFIED] [2022-12-13 18:57:32,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0#1_216,QUANTIFIED] [2022-12-13 18:57:32,495 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 && 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 / 4 + 4 <= i && a == 0) && 1 <= i) && (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)) && cond == 1) && 5 <= 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) && !(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)) && (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]) && 4 <= i)) || ((((((((((((((-a / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= 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]) && 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) && 6 <= i)) || ((((((((((((((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 / 4 + 4 <= i && a == 0) && 1 <= i) && 5 <= 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 * 4 == 24) && (!(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 <= 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-12-13 18:57:32,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf93e62-8221-46f6-a303-e606478fef9e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE