./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/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_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/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_e720a86a-6cbc-427e-9a29-ff9f8a109908/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 a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a --- 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 11:57:36,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:57:36,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:57:36,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:57:36,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:57:36,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:57:36,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:57:36,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:57:36,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:57:36,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:57:36,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:57:36,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:57:36,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:57:36,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:57:36,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:57:36,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:57:36,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:57:36,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:57:36,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:57:36,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:57:36,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:57:36,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:57:36,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:57:36,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:57:36,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:57:36,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:57:36,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:57:36,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:57:36,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:57:36,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:57:36,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:57:36,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:57:36,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:57:36,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:57:36,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:57:36,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:57:36,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:57:36,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:57:36,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:57:36,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:57:36,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:57:36,592 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 11:57:36,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:57:36,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:57:36,613 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:57:36,613 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:57:36,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:57:36,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:57:36,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:57:36,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:57:36,621 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:57:36,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:57:36,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:57:36,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:57:36,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:57:36,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:57:36,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:57:36,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:57:36,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:57:36,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:57:36,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:57:36,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:57:36,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:57:36,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:57:36,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:57:36,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:57:36,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:57:36,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:57:36,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:57:36,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:57:36,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:57:36,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:57:36,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:57:36,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:57:36,625 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:57:36,625 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:57:36,625 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:57:36,625 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_e720a86a-6cbc-427e-9a29-ff9f8a109908/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_e720a86a-6cbc-427e-9a29-ff9f8a109908/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 -> a8791b6973aa1a0d5421161a634fa2e6c3276aa5fd05ed6d81de7a2762aa206a [2022-12-13 11:57:36,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:57:36,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:57:36,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:57:36,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:57:36,812 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:57:36,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2022-12-13 11:57:39,332 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:57:39,491 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:57:39,492 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c [2022-12-13 11:57:39,496 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/data/835a4567d/93bb425a9411423e81e4d04c33efb96f/FLAG4e5b5bf45 [2022-12-13 11:57:39,912 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/data/835a4567d/93bb425a9411423e81e4d04c33efb96f [2022-12-13 11:57:39,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:57:39,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:57:39,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:57:39,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:57:39,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:57:39,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:57:39" (1/1) ... [2022-12-13 11:57:39,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b3603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:39, skipping insertion in model container [2022-12-13 11:57:39,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:57:39" (1/1) ... [2022-12-13 11:57:39,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:57:39,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:57:40,054 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_e720a86a-6cbc-427e-9a29-ff9f8a109908/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-12-13 11:57:40,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:57:40,076 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:57:40,086 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/sv-benchmarks/c/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-12-13 11:57:40,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:57:40,103 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:57:40,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40 WrapperNode [2022-12-13 11:57:40,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:57:40,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:57:40,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:57:40,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:57:40,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,128 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2022-12-13 11:57:40,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:57:40,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:57:40,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:57:40,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:57:40,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,145 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:57:40,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:57:40,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:57:40,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:57:40,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (1/1) ... [2022-12-13 11:57:40,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:57:40,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:40,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:57:40,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:57:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:57:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:57:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:57:40,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:57:40,255 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:57:40,257 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:57:40,364 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:57:40,369 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:57:40,369 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 11:57:40,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:57:40 BoogieIcfgContainer [2022-12-13 11:57:40,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:57:40,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:57:40,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:57:40,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:57:40,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:57:39" (1/3) ... [2022-12-13 11:57:40,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b0f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:57:40, skipping insertion in model container [2022-12-13 11:57:40,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:40" (2/3) ... [2022-12-13 11:57:40,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b0f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:57:40, skipping insertion in model container [2022-12-13 11:57:40,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:57:40" (3/3) ... [2022-12-13 11:57:40,379 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2022-12-13 11:57:40,394 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:57:40,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:57:40,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:57:40,438 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;@1d4f9999, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:57:40,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 11:57:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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 11:57:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 11:57:40,447 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:40,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:40,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash -493598204, now seen corresponding path program 1 times [2022-12-13 11:57:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:40,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493606239] [2022-12-13 11:57:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:40,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:40,561 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 11:57:40,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:40,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493606239] [2022-12-13 11:57:40,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493606239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:40,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:40,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:57:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677600734] [2022-12-13 11:57:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:40,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:57:40,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:57:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:57:40,593 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 11:57:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:40,605 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2022-12-13 11:57:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:57:40,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 11:57:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:40,612 INFO L225 Difference]: With dead ends: 35 [2022-12-13 11:57:40,612 INFO L226 Difference]: Without dead ends: 17 [2022-12-13 11:57:40,614 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 11:57:40,617 INFO L413 NwaCegarLoop]: 23 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, 23 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 11:57:40,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:57:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-13 11:57:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-12-13 11:57:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 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 11:57:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-12-13 11:57:40,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2022-12-13 11:57:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:40,641 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-12-13 11:57:40,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 11:57:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-12-13 11:57:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 11:57:40,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:40,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:40,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:57:40,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2059231113, now seen corresponding path program 1 times [2022-12-13 11:57:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:40,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867108740] [2022-12-13 11:57:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:40,738 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 11:57:40,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:40,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867108740] [2022-12-13 11:57:40,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867108740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:40,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:40,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:40,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364981015] [2022-12-13 11:57:40,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:40,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:40,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:40,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:40,741 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 11:57:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:40,791 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-12-13 11:57:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:40,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 11:57:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:40,792 INFO L225 Difference]: With dead ends: 34 [2022-12-13 11:57:40,792 INFO L226 Difference]: Without dead ends: 21 [2022-12-13 11:57:40,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:40,793 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:40,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:57:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-12-13 11:57:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-12-13 11:57:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) 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 11:57:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-12-13 11:57:40,798 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2022-12-13 11:57:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:40,798 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-12-13 11:57:40,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 11:57:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-12-13 11:57:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 11:57:40,799 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:40,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:40,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:57:40,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 573171571, now seen corresponding path program 1 times [2022-12-13 11:57:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:40,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497883178] [2022-12-13 11:57:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:40,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:57:40,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:40,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497883178] [2022-12-13 11:57:40,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497883178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:40,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:40,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:40,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598514929] [2022-12-13 11:57:40,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:40,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:40,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:40,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:40,850 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:40,900 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-12-13 11:57:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:40,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 11:57:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:40,901 INFO L225 Difference]: With dead ends: 41 [2022-12-13 11:57:40,901 INFO L226 Difference]: Without dead ends: 27 [2022-12-13 11:57:40,902 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 11:57:40,903 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:40,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:57:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-13 11:57:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-12-13 11:57:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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 11:57:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-12-13 11:57:40,909 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2022-12-13 11:57:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:40,910 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-12-13 11:57:40,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-12-13 11:57:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 11:57:40,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:40,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:40,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:57:40,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:40,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:40,912 INFO L85 PathProgramCache]: Analyzing trace with hash 630429873, now seen corresponding path program 1 times [2022-12-13 11:57:40,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:40,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429868214] [2022-12-13 11:57:40,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:40,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:57:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429868214] [2022-12-13 11:57:41,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429868214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:41,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:41,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104805224] [2022-12-13 11:57:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:41,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:41,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:41,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:41,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:41,045 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:41,078 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2022-12-13 11:57:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:41,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 11:57:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:41,080 INFO L225 Difference]: With dead ends: 49 [2022-12-13 11:57:41,080 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 11:57:41,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:41,081 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:41,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:57:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 11:57:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-12-13 11:57:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 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 11:57:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-12-13 11:57:41,091 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2022-12-13 11:57:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:41,091 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-12-13 11:57:41,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-12-13 11:57:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 11:57:41,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:41,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:41,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:57:41,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:41,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:41,094 INFO L85 PathProgramCache]: Analyzing trace with hash 630489455, now seen corresponding path program 1 times [2022-12-13 11:57:41,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:41,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320021952] [2022-12-13 11:57:41,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:41,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:41,166 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 11:57:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:41,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320021952] [2022-12-13 11:57:41,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320021952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:57:41,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659240842] [2022-12-13 11:57:41,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:41,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:41,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:41,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:57:41,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 11:57:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:41,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 11:57:41,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:57:41,288 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 11:57:41,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:57:41,317 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 11:57:41,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659240842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:57:41,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:57:41,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 11:57:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511973114] [2022-12-13 11:57:41,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:57:41,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:57:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:41,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:57:41,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:57:41,320 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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 11:57:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:41,389 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2022-12-13 11:57:41,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:57:41,389 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 11:57:41,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:41,390 INFO L225 Difference]: With dead ends: 79 [2022-12-13 11:57:41,390 INFO L226 Difference]: Without dead ends: 51 [2022-12-13 11:57:41,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:57:41,392 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:41,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 18 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:57:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-13 11:57:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-12-13 11:57:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 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 11:57:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-12-13 11:57:41,401 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 15 [2022-12-13 11:57:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:41,401 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-12-13 11:57:41,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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 11:57:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-12-13 11:57:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 11:57:41,402 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:41,402 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:41,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 11:57:41,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:41,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash -901646477, now seen corresponding path program 2 times [2022-12-13 11:57:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374718080] [2022-12-13 11:57:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:41,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374718080] [2022-12-13 11:57:41,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374718080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:57:41,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691548023] [2022-12-13 11:57:41,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:57:41,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:41,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:41,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:57:41,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 11:57:41,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:57:41,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:57:41,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 11:57:41,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:57:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 11:57:41,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:57:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 11:57:41,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691548023] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:57:41,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:57:41,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2022-12-13 11:57:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973636702] [2022-12-13 11:57:41,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:57:41,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 11:57:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 11:57:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:57:41,992 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 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 11:57:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:42,354 INFO L93 Difference]: Finished difference Result 237 states and 337 transitions. [2022-12-13 11:57:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:57:42,355 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 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) Word has length 24 [2022-12-13 11:57:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:42,356 INFO L225 Difference]: With dead ends: 237 [2022-12-13 11:57:42,356 INFO L226 Difference]: Without dead ends: 191 [2022-12-13 11:57:42,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=381, Invalid=951, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 11:57:42,357 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 233 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:42,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 66 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:57:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-13 11:57:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2022-12-13 11:57:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 169 states have internal predecessors, (216), 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 11:57:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2022-12-13 11:57:42,375 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 24 [2022-12-13 11:57:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:42,375 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2022-12-13 11:57:42,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 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 11:57:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2022-12-13 11:57:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 11:57:42,376 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:42,376 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:42,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 11:57:42,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:42,578 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1843449907, now seen corresponding path program 1 times [2022-12-13 11:57:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:42,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640947356] [2022-12-13 11:57:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-13 11:57:42,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:42,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640947356] [2022-12-13 11:57:42,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640947356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:42,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:42,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:42,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548137891] [2022-12-13 11:57:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:42,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:42,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:42,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:42,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:42,697 INFO L87 Difference]: Start difference. First operand 170 states and 216 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:42,748 INFO L93 Difference]: Finished difference Result 381 states and 487 transitions. [2022-12-13 11:57:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-13 11:57:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:42,750 INFO L225 Difference]: With dead ends: 381 [2022-12-13 11:57:42,750 INFO L226 Difference]: Without dead ends: 215 [2022-12-13 11:57:42,750 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 11:57:42,751 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:42,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:57:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-12-13 11:57:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2022-12-13 11:57:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 197 states have internal predecessors, (250), 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 11:57:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2022-12-13 11:57:42,770 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 30 [2022-12-13 11:57:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:42,770 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2022-12-13 11:57:42,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2022-12-13 11:57:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 11:57:42,771 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:42,771 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:42,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:57:42,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash 399501479, now seen corresponding path program 1 times [2022-12-13 11:57:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:42,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955110910] [2022-12-13 11:57:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:42,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955110910] [2022-12-13 11:57:42,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955110910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:57:42,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066222197] [2022-12-13 11:57:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:42,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:42,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:42,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:57:42,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 11:57:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:42,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 11:57:42,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:57:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:43,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:57:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:43,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066222197] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:57:43,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:57:43,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-13 11:57:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553557876] [2022-12-13 11:57:43,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:57:43,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 11:57:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:43,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 11:57:43,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2022-12-13 11:57:43,108 INFO L87 Difference]: Start difference. First operand 198 states and 250 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 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 11:57:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:43,323 INFO L93 Difference]: Finished difference Result 585 states and 801 transitions. [2022-12-13 11:57:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:57:43,324 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-13 11:57:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:43,325 INFO L225 Difference]: With dead ends: 585 [2022-12-13 11:57:43,325 INFO L226 Difference]: Without dead ends: 391 [2022-12-13 11:57:43,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2022-12-13 11:57:43,326 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 129 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:43,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 37 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:57:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-12-13 11:57:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 390. [2022-12-13 11:57:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.2596401028277635) internal successors, (490), 389 states have internal predecessors, (490), 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 11:57:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 490 transitions. [2022-12-13 11:57:43,350 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 490 transitions. Word has length 31 [2022-12-13 11:57:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:43,351 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 490 transitions. [2022-12-13 11:57:43,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 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 11:57:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 490 transitions. [2022-12-13 11:57:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 11:57:43,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:43,352 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:43,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 11:57:43,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:43,554 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:43,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash -871125337, now seen corresponding path program 2 times [2022-12-13 11:57:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:43,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931307364] [2022-12-13 11:57:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:43,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:43,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931307364] [2022-12-13 11:57:43,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931307364] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:57:43,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376234347] [2022-12-13 11:57:43,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:57:43,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:43,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:43,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:57:43,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 11:57:43,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:57:43,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:57:43,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 11:57:43,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:57:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:44,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:57:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:44,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376234347] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:57:44,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:57:44,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-12-13 11:57:44,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284729002] [2022-12-13 11:57:44,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:57:44,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 11:57:44,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:44,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 11:57:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2022-12-13 11:57:44,349 INFO L87 Difference]: Start difference. First operand 390 states and 490 transitions. Second operand has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 38 states have internal predecessors, (120), 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 11:57:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:44,533 INFO L93 Difference]: Finished difference Result 921 states and 1205 transitions. [2022-12-13 11:57:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 11:57:44,533 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 38 states have internal predecessors, (120), 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 55 [2022-12-13 11:57:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:44,536 INFO L225 Difference]: With dead ends: 921 [2022-12-13 11:57:44,536 INFO L226 Difference]: Without dead ends: 535 [2022-12-13 11:57:44,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 78 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2022-12-13 11:57:44,538 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 153 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:44,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 27 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:57:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-12-13 11:57:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 534. [2022-12-13 11:57:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.2570356472795496) internal successors, (670), 533 states have internal predecessors, (670), 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 11:57:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 670 transitions. [2022-12-13 11:57:44,570 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 670 transitions. Word has length 55 [2022-12-13 11:57:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:44,570 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 670 transitions. [2022-12-13 11:57:44,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.076923076923077) internal successors, (120), 38 states have internal predecessors, (120), 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 11:57:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 670 transitions. [2022-12-13 11:57:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 11:57:44,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:44,572 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:44,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 11:57:44,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:44,774 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:44,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1639992537, now seen corresponding path program 3 times [2022-12-13 11:57:44,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:44,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721469251] [2022-12-13 11:57:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:44,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721469251] [2022-12-13 11:57:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721469251] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:57:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415705943] [2022-12-13 11:57:45,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 11:57:45,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:45,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:45,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:57:45,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 11:57:45,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 11:57:45,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:57:45,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 11:57:45,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:57:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-12-13 11:57:45,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:57:45,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415705943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:45,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:57:45,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [27] total 31 [2022-12-13 11:57:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144220331] [2022-12-13 11:57:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:45,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:57:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:45,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:57:45,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=631, Unknown=0, NotChecked=0, Total=930 [2022-12-13 11:57:45,858 INFO L87 Difference]: Start difference. First operand 534 states and 670 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 11:57:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:45,996 INFO L93 Difference]: Finished difference Result 1188 states and 1481 transitions. [2022-12-13 11:57:45,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:57:45,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 73 [2022-12-13 11:57:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:45,999 INFO L225 Difference]: With dead ends: 1188 [2022-12-13 11:57:45,999 INFO L226 Difference]: Without dead ends: 1186 [2022-12-13 11:57:45,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2022-12-13 11:57:46,000 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:46,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 52 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:57:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-12-13 11:57:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 732. [2022-12-13 11:57:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 1.2476060191518468) internal successors, (912), 731 states have internal predecessors, (912), 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 11:57:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 912 transitions. [2022-12-13 11:57:46,039 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 912 transitions. Word has length 73 [2022-12-13 11:57:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:46,039 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 912 transitions. [2022-12-13 11:57:46,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 11:57:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 912 transitions. [2022-12-13 11:57:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 11:57:46,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:46,040 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:46,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 11:57:46,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 11:57:46,241 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash -336186329, now seen corresponding path program 1 times [2022-12-13 11:57:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:46,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885384674] [2022-12-13 11:57:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 11:57:46,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:46,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885384674] [2022-12-13 11:57:46,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885384674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:46,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:46,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-12-13 11:57:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841290504] [2022-12-13 11:57:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:46,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 11:57:46,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 11:57:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-12-13 11:57:46,520 INFO L87 Difference]: Start difference. First operand 732 states and 912 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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 11:57:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:46,820 INFO L93 Difference]: Finished difference Result 3122 states and 4018 transitions. [2022-12-13 11:57:46,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:57:46,821 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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 73 [2022-12-13 11:57:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:46,825 INFO L225 Difference]: With dead ends: 3122 [2022-12-13 11:57:46,825 INFO L226 Difference]: Without dead ends: 2671 [2022-12-13 11:57:46,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-12-13 11:57:46,827 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 532 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:46,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 146 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:57:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2022-12-13 11:57:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 739. [2022-12-13 11:57:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.1761517615176151) internal successors, (868), 738 states have internal predecessors, (868), 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 11:57:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 868 transitions. [2022-12-13 11:57:46,887 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 868 transitions. Word has length 73 [2022-12-13 11:57:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:46,887 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 868 transitions. [2022-12-13 11:57:46,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 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 11:57:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 868 transitions. [2022-12-13 11:57:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 11:57:46,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:46,888 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:46,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:57:46,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:46,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:46,888 INFO L85 PathProgramCache]: Analyzing trace with hash 243663591, now seen corresponding path program 2 times [2022-12-13 11:57:46,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:46,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915867716] [2022-12-13 11:57:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:47,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915867716] [2022-12-13 11:57:47,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915867716] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:57:47,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091445410] [2022-12-13 11:57:47,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:57:47,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:47,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:47,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:57:47,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 11:57:47,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:57:47,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:57:47,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 11:57:47,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:57:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:48,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:57:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:49,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091445410] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:57:49,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:57:49,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 75 [2022-12-13 11:57:49,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725017118] [2022-12-13 11:57:49,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:57:49,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-12-13 11:57:49,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:49,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-12-13 11:57:49,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1499, Invalid=4201, Unknown=0, NotChecked=0, Total=5700 [2022-12-13 11:57:49,681 INFO L87 Difference]: Start difference. First operand 739 states and 868 transitions. Second operand has 76 states, 76 states have (on average 2.6973684210526314) internal successors, (205), 75 states have internal predecessors, (205), 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 11:57:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:56,087 INFO L93 Difference]: Finished difference Result 2093 states and 2470 transitions. [2022-12-13 11:57:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-12-13 11:57:56,087 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 2.6973684210526314) internal successors, (205), 75 states have internal predecessors, (205), 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 73 [2022-12-13 11:57:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:56,090 INFO L225 Difference]: With dead ends: 2093 [2022-12-13 11:57:56,090 INFO L226 Difference]: Without dead ends: 1697 [2022-12-13 11:57:56,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19147 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7653, Invalid=40527, Unknown=0, NotChecked=0, Total=48180 [2022-12-13 11:57:56,097 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1122 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:56,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 142 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 11:57:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2022-12-13 11:57:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1038. [2022-12-13 11:57:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.2256509161041467) internal successors, (1271), 1037 states have internal predecessors, (1271), 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 11:57:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1271 transitions. [2022-12-13 11:57:56,184 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1271 transitions. Word has length 73 [2022-12-13 11:57:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:56,184 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1271 transitions. [2022-12-13 11:57:56,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 2.6973684210526314) internal successors, (205), 75 states have internal predecessors, (205), 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 11:57:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1271 transitions. [2022-12-13 11:57:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 11:57:56,185 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:56,185 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:56,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 11:57:56,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:56,386 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:56,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1623737319, now seen corresponding path program 1 times [2022-12-13 11:57:56,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:56,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699824842] [2022-12-13 11:57:56,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:56,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-12-13 11:57:56,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:56,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699824842] [2022-12-13 11:57:56,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699824842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:56,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:56,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958885959] [2022-12-13 11:57:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:56,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:56,443 INFO L87 Difference]: Start difference. First operand 1038 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 11:57:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:57:56,572 INFO L93 Difference]: Finished difference Result 1734 states and 2124 transitions. [2022-12-13 11:57:56,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:56,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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) Word has length 73 [2022-12-13 11:57:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:57:56,575 INFO L225 Difference]: With dead ends: 1734 [2022-12-13 11:57:56,575 INFO L226 Difference]: Without dead ends: 1388 [2022-12-13 11:57:56,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:57:56,576 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:57:56,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:57:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2022-12-13 11:57:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1108. [2022-12-13 11:57:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 1.2321589882565491) internal successors, (1364), 1107 states have internal predecessors, (1364), 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 11:57:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1364 transitions. [2022-12-13 11:57:56,673 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1364 transitions. Word has length 73 [2022-12-13 11:57:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:57:56,673 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1364 transitions. [2022-12-13 11:57:56,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 11:57:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1364 transitions. [2022-12-13 11:57:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-13 11:57:56,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:57:56,674 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:56,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:57:56,674 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:57:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2061521628, now seen corresponding path program 1 times [2022-12-13 11:57:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:56,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663648426] [2022-12-13 11:57:56,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1838 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-12-13 11:57:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:57,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663648426] [2022-12-13 11:57:57,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663648426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:57:57,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602687836] [2022-12-13 11:57:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:57,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:57:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:57:57,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:57:57,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 11:57:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:57,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 11:57:57,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:57:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1838 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-12-13 11:57:58,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:57:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1837 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2022-12-13 11:57:59,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602687836] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:57:59,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:57:59,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 26] total 74 [2022-12-13 11:57:59,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552205814] [2022-12-13 11:57:59,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:57:59,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-13 11:57:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:59,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-13 11:57:59,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1582, Invalid=3968, Unknown=0, NotChecked=0, Total=5550 [2022-12-13 11:57:59,963 INFO L87 Difference]: Start difference. First operand 1108 states and 1364 transitions. Second operand has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 74 states have internal predecessors, (235), 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 11:58:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:58:02,473 INFO L93 Difference]: Finished difference Result 1717 states and 2090 transitions. [2022-12-13 11:58:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-12-13 11:58:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 74 states have internal predecessors, (235), 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 142 [2022-12-13 11:58:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:58:02,477 INFO L225 Difference]: With dead ends: 1717 [2022-12-13 11:58:02,477 INFO L226 Difference]: Without dead ends: 1073 [2022-12-13 11:58:02,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 234 SyntacticMatches, 3 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10335 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5777, Invalid=22953, Unknown=0, NotChecked=0, Total=28730 [2022-12-13 11:58:02,481 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 893 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:58:02,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 84 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:58:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-12-13 11:58:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 829. [2022-12-13 11:58:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.1920289855072463) internal successors, (987), 828 states have internal predecessors, (987), 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 11:58:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 987 transitions. [2022-12-13 11:58:02,572 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 987 transitions. Word has length 142 [2022-12-13 11:58:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:58:02,572 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 987 transitions. [2022-12-13 11:58:02,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 74 states have internal predecessors, (235), 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 11:58:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 987 transitions. [2022-12-13 11:58:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-13 11:58:02,573 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:58:02,573 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:02,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 11:58:02,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 11:58:02,775 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:58:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2032536794, now seen corresponding path program 1 times [2022-12-13 11:58:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:02,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360096113] [2022-12-13 11:58:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:02,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-12-13 11:58:02,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:02,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360096113] [2022-12-13 11:58:02,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360096113] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:58:02,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925599911] [2022-12-13 11:58:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:02,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:58:02,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:58:02,887 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:58:02,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 11:58:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:02,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 11:58:02,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:58:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-12-13 11:58:03,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:58:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 2 proven. 1246 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2022-12-13 11:58:03,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925599911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:58:03,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:58:03,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-13 11:58:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878327054] [2022-12-13 11:58:03,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:58:03,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:58:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:03,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:58:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:58:03,316 INFO L87 Difference]: Start difference. First operand 829 states and 987 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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 11:58:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:58:03,546 INFO L93 Difference]: Finished difference Result 2539 states and 3079 transitions. [2022-12-13 11:58:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:58:03,546 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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 142 [2022-12-13 11:58:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:58:03,548 INFO L225 Difference]: With dead ends: 2539 [2022-12-13 11:58:03,548 INFO L226 Difference]: Without dead ends: 1109 [2022-12-13 11:58:03,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=140, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:58:03,550 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 202 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:58:03,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 84 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:58:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-12-13 11:58:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1105. [2022-12-13 11:58:03,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 1.151268115942029) internal successors, (1271), 1104 states have internal predecessors, (1271), 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 11:58:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1271 transitions. [2022-12-13 11:58:03,638 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1271 transitions. Word has length 142 [2022-12-13 11:58:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:58:03,639 INFO L495 AbstractCegarLoop]: Abstraction has 1105 states and 1271 transitions. [2022-12-13 11:58:03,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 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 11:58:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1271 transitions. [2022-12-13 11:58:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2022-12-13 11:58:03,643 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:58:03,643 INFO L195 NwaCegarLoop]: trace histogram [120, 120, 120, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:03,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 11:58:03,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 11:58:03,844 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:58:03,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash 449680486, now seen corresponding path program 2 times [2022-12-13 11:58:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:03,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824592253] [2022-12-13 11:58:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2022-12-13 11:58:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:04,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824592253] [2022-12-13 11:58:04,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824592253] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:58:04,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266358488] [2022-12-13 11:58:04,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:58:04,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:58:04,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:58:04,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:58:04,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 11:58:04,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:58:04,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:58:04,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 11:58:04,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:58:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2022-12-13 11:58:04,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:58:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22270 backedges. 10 proven. 18720 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2022-12-13 11:58:05,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266358488] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:58:05,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:58:05,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-13 11:58:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59926540] [2022-12-13 11:58:05,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:58:05,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 11:58:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 11:58:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2022-12-13 11:58:05,425 INFO L87 Difference]: Start difference. First operand 1105 states and 1271 transitions. Second operand has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 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 11:58:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:58:05,903 INFO L93 Difference]: Finished difference Result 4179 states and 5031 transitions. [2022-12-13 11:58:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:58:05,903 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 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 418 [2022-12-13 11:58:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:58:05,906 INFO L225 Difference]: With dead ends: 4179 [2022-12-13 11:58:05,906 INFO L226 Difference]: Without dead ends: 1665 [2022-12-13 11:58:05,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2022-12-13 11:58:05,908 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 380 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:58:05,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 188 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:58:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2022-12-13 11:58:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1657. [2022-12-13 11:58:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1656 states have (on average 1.1105072463768115) internal successors, (1839), 1656 states have internal predecessors, (1839), 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 11:58:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 1839 transitions. [2022-12-13 11:58:06,034 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 1839 transitions. Word has length 418 [2022-12-13 11:58:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:58:06,034 INFO L495 AbstractCegarLoop]: Abstraction has 1657 states and 1839 transitions. [2022-12-13 11:58:06,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.76) internal successors, (219), 24 states have internal predecessors, (219), 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 11:58:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 1839 transitions. [2022-12-13 11:58:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2022-12-13 11:58:06,051 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:58:06,051 INFO L195 NwaCegarLoop]: trace histogram [280, 280, 280, 14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:06,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 11:58:06,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 11:58:06,253 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:58:06,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash 133527270, now seen corresponding path program 3 times [2022-12-13 11:58:06,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:06,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455365861] [2022-12-13 11:58:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:58:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2022-12-13 11:58:07,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:58:07,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455365861] [2022-12-13 11:58:07,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455365861] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:58:07,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652099315] [2022-12-13 11:58:07,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 11:58:07,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:58:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:58:07,665 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:58:07,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 11:58:08,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 132 check-sat command(s) [2022-12-13 11:58:08,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:58:08,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 11:58:08,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:58:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2022-12-13 11:58:10,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:58:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 121906 backedges. 26 proven. 113620 refuted. 0 times theorem prover too weak. 8260 trivial. 0 not checked. [2022-12-13 11:58:11,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652099315] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:58:11,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:58:11,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-12-13 11:58:11,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019493650] [2022-12-13 11:58:11,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:58:11,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 11:58:11,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:58:11,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 11:58:11,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2022-12-13 11:58:11,284 INFO L87 Difference]: Start difference. First operand 1657 states and 1839 transitions. Second operand has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 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 11:58:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:58:11,883 INFO L93 Difference]: Finished difference Result 4049 states and 4765 transitions. [2022-12-13 11:58:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 11:58:11,884 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 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 970 [2022-12-13 11:58:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:58:11,887 INFO L225 Difference]: With dead ends: 4049 [2022-12-13 11:58:11,887 INFO L226 Difference]: Without dead ends: 2077 [2022-12-13 11:58:11,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1960 GetRequests, 1908 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2022-12-13 11:58:11,889 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 230 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:58:11,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 231 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:58:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2022-12-13 11:58:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2071. [2022-12-13 11:58:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2070 states have (on average 1.0942028985507246) internal successors, (2265), 2070 states have internal predecessors, (2265), 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 11:58:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2265 transitions. [2022-12-13 11:58:12,038 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2265 transitions. Word has length 970 [2022-12-13 11:58:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:58:12,039 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 2265 transitions. [2022-12-13 11:58:12,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.333333333333334) internal successors, (403), 38 states have internal predecessors, (403), 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 11:58:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2265 transitions. [2022-12-13 11:58:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1385 [2022-12-13 11:58:12,050 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:58:12,050 INFO L195 NwaCegarLoop]: trace histogram [400, 400, 400, 20, 20, 20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:12,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 11:58:12,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 11:58:12,252 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:58:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:58:12,254 INFO L85 PathProgramCache]: Analyzing trace with hash 341765318, now seen corresponding path program 4 times [2022-12-13 11:58:12,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:58:12,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270334196] [2022-12-13 11:58:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:58:12,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:58:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:58:12,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:58:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:58:12,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:58:12,983 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:58:12,983 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 11:58:12,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:58:12,988 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:58:12,992 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:58:13,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:58:13 BoogieIcfgContainer [2022-12-13 11:58:13,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:58:13,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:58:13,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:58:13,231 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:58:13,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:57:40" (3/4) ... [2022-12-13 11:58:13,233 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 11:58:13,455 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 11:58:13,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:58:13,456 INFO L158 Benchmark]: Toolchain (without parser) took 33539.70ms. Allocated memory was 140.5MB in the beginning and 390.1MB in the end (delta: 249.6MB). Free memory was 106.3MB in the beginning and 119.8MB in the end (delta: -13.4MB). Peak memory consumption was 236.6MB. Max. memory is 16.1GB. [2022-12-13 11:58:13,456 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 140.5MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:58:13,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.87ms. Allocated memory is still 140.5MB. Free memory was 105.9MB in the beginning and 95.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 11:58:13,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.40ms. Allocated memory is still 140.5MB. Free memory was 95.4MB in the beginning and 94.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:58:13,457 INFO L158 Benchmark]: Boogie Preprocessor took 18.28ms. Allocated memory is still 140.5MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:58:13,457 INFO L158 Benchmark]: RCFGBuilder took 223.27ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 81.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 11:58:13,457 INFO L158 Benchmark]: TraceAbstraction took 32858.02ms. Allocated memory was 140.5MB in the beginning and 390.1MB in the end (delta: 249.6MB). Free memory was 81.2MB in the beginning and 175.4MB in the end (delta: -94.2MB). Peak memory consumption was 217.7MB. Max. memory is 16.1GB. [2022-12-13 11:58:13,457 INFO L158 Benchmark]: Witness Printer took 224.16ms. Allocated memory is still 390.1MB. Free memory was 175.4MB in the beginning and 119.8MB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-12-13 11:58:13,458 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.15ms. Allocated memory is still 140.5MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.87ms. Allocated memory is still 140.5MB. Free memory was 105.9MB in the beginning and 95.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.40ms. Allocated memory is still 140.5MB. Free memory was 95.4MB in the beginning and 94.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.28ms. Allocated memory is still 140.5MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 223.27ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 81.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 32858.02ms. Allocated memory was 140.5MB in the beginning and 390.1MB in the end (delta: 249.6MB). Free memory was 81.2MB in the beginning and 175.4MB in the end (delta: -94.2MB). Peak memory consumption was 217.7MB. Max. memory is 16.1GB. * Witness Printer took 224.16ms. Allocated memory is still 390.1MB. Free memory was 175.4MB in the beginning and 119.8MB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L9] int last ; [L18] int SIZE = 20; VAL [last=0, SIZE=20] [L20] last = __VERIFIER_nondet_int() [L21] CALL assume_abort_if_not(last > 0) [L6] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L21] RET assume_abort_if_not(last > 0) [L22] int a=0,b=0,c=0,st=0,d=0; VAL [a=0, b=0, c=0, d=0, last=21, SIZE=20, st=0] [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=0, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=1, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=2, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=3, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=4, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=5, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=6, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=7, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=8, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=9, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=10, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=11, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=12, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=13, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=14, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=15, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=16, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=17, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=18, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=0, b=0, c=19, d=0, last=21, SIZE=20, st=1] [L25] c++ VAL [a=0, b=0, c=20, d=0, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=0, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=1, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=2, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=3, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=4, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=5, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=6, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=7, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=8, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=9, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=10, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=11, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=12, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=13, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=14, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=15, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=16, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=17, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=18, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=2, b=2, c=19, d=1, last=21, SIZE=20, st=1] [L25] c++ VAL [a=2, b=2, c=20, d=1, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=0, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=1, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=2, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=3, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=4, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=5, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=6, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=7, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=8, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=9, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=10, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=11, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=12, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=13, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=14, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=15, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=16, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=17, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=18, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=4, b=4, c=19, d=2, last=21, SIZE=20, st=1] [L25] c++ VAL [a=4, b=4, c=20, d=2, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=0, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=1, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=2, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=3, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=4, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=5, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=6, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=7, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=8, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=9, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=10, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=11, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=12, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=13, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=14, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=15, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=16, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=17, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=18, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=6, b=6, c=19, d=3, last=21, SIZE=20, st=1] [L25] c++ VAL [a=6, b=6, c=20, d=3, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=0, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=1, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=2, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=3, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=4, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=5, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=6, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=7, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=8, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=9, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=10, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=11, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=12, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=13, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=14, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=15, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=16, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=17, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=18, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=8, b=8, c=19, d=4, last=21, SIZE=20, st=1] [L25] c++ VAL [a=8, b=8, c=20, d=4, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=0, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=1, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=2, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=3, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=4, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=5, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=6, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=7, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=8, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=9, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=10, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=11, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=12, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=13, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=14, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=15, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=16, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=17, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=18, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=10, b=10, c=19, d=5, last=21, SIZE=20, st=1] [L25] c++ VAL [a=10, b=10, c=20, d=5, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=0, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=1, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=2, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=3, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=4, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=5, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=6, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=7, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=8, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=9, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=10, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=11, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=12, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=13, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=14, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=15, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=16, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=17, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=18, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=12, b=12, c=19, d=6, last=21, SIZE=20, st=1] [L25] c++ VAL [a=12, b=12, c=20, d=6, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=0, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=1, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=2, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=3, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=4, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=5, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=6, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=7, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=8, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=9, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=10, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=11, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=12, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=13, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=14, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=15, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=16, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=17, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=18, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=14, b=14, c=19, d=7, last=21, SIZE=20, st=1] [L25] c++ VAL [a=14, b=14, c=20, d=7, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=0, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=1, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=2, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=3, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=4, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=5, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=6, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=7, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=8, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=9, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=10, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=11, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=12, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=13, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=14, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=15, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=16, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=17, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=18, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=16, b=16, c=19, d=8, last=21, SIZE=20, st=1] [L25] c++ VAL [a=16, b=16, c=20, d=8, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=0, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=1, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=2, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=3, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=4, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=5, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=6, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=7, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=8, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=9, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=10, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=11, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=12, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=13, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=14, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=15, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=16, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=17, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=18, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=18, b=18, c=19, d=9, last=21, SIZE=20, st=1] [L25] c++ VAL [a=18, b=18, c=20, d=9, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=0, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=1, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=2, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=3, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=4, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=5, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=6, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=7, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=8, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=9, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=10, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=11, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=12, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=13, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=14, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=15, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=16, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=17, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=18, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=20, b=20, c=19, d=10, last=21, SIZE=20, st=1] [L25] c++ VAL [a=20, b=20, c=20, d=10, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=0, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=1, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=2, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=3, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=4, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=5, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=6, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=7, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=8, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=9, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=10, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=11, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=12, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=13, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=14, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=15, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=16, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=17, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=18, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=22, b=22, c=19, d=11, last=21, SIZE=20, st=1] [L25] c++ VAL [a=22, b=22, c=20, d=11, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=0, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=1, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=2, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=3, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=4, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=5, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=6, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=7, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=8, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=9, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=10, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=11, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=12, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=13, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=14, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=15, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=16, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=17, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=18, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=24, b=24, c=19, d=12, last=21, SIZE=20, st=1] [L25] c++ VAL [a=24, b=24, c=20, d=12, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=0, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=1, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=2, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=3, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=4, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=5, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=6, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=7, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=8, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=9, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=10, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=11, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=12, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=13, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=14, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=15, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=16, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=17, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=18, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=26, b=26, c=19, d=13, last=21, SIZE=20, st=1] [L25] c++ VAL [a=26, b=26, c=20, d=13, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=0, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=1, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=2, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=3, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=4, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=5, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=6, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=7, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=8, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=9, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=10, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=11, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=12, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=13, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=14, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=15, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=16, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=17, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=18, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=28, b=28, c=19, d=14, last=21, SIZE=20, st=1] [L25] c++ VAL [a=28, b=28, c=20, d=14, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=0, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=1, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=2, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=3, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=4, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=5, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=6, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=7, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=8, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=9, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=10, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=11, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=12, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=13, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=14, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=15, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=16, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=17, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=18, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=30, b=30, c=19, d=15, last=21, SIZE=20, st=1] [L25] c++ VAL [a=30, b=30, c=20, d=15, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=0, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=1, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=2, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=3, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=4, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=5, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=6, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=7, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=8, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=9, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=10, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=11, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=12, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=13, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=14, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=15, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=16, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=17, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=18, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=32, b=32, c=19, d=16, last=21, SIZE=20, st=1] [L25] c++ VAL [a=32, b=32, c=20, d=16, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=0, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=1, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=2, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=3, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=4, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=5, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=6, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=7, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=8, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=9, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=10, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=11, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=12, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=13, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=14, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=15, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=16, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=17, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=18, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=34, b=34, c=19, d=17, last=21, SIZE=20, st=1] [L25] c++ VAL [a=34, b=34, c=20, d=17, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=0, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=1, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=2, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=3, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=4, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=5, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=6, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=7, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=8, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=9, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=10, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=11, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=12, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=13, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=14, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=15, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=16, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=17, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=18, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=36, b=36, c=19, d=18, last=21, SIZE=20, st=1] [L25] c++ VAL [a=36, b=36, c=20, d=18, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L37] COND FALSE !(d == SIZE) VAL [a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, last=21, SIZE=20] [L42] RET __VERIFIER_assert(a==b && c==SIZE) [L23] COND TRUE 1 [L24] st=1 [L25] c=0 VAL [a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=0, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=1, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=2, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=3, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=4, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=5, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=6, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=7, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=8, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=9, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=10, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=11, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=12, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=13, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=14, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=15, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=16, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=17, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=18, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] COND TRUE c=last) VAL [a=38, b=38, c=19, d=19, last=21, SIZE=20, st=1] [L25] c++ VAL [a=38, b=38, c=20, d=19, last=21, SIZE=20, st=1] [L25] COND FALSE !(c=SIZE [L35] d++ VAL [a=40, b=40, c=20, d=20, last=21, SIZE=20, st=1] [L37] COND TRUE d == SIZE [L38] a = 0 [L39] b = 1 VAL [a=0, b=1, c=20, d=20, last=21, SIZE=20, st=1] [L42] CALL __VERIFIER_assert(a==b && c==SIZE) [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, last=21, SIZE=20] [L12] reach_error() VAL [\old(cond)=0, cond=0, last=21, SIZE=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.6s, OverallIterations: 18, TraceHistogramMax: 400, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4077 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4077 mSDsluCounter, 1261 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 967 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3291 IncrementalHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 294 mSDtfsCounter, 3291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4279 GetRequests, 3602 SyntacticMatches, 28 SemanticMatches, 649 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32846 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2071occurred in iteration=17, InterpolantAutomatonStates: 443, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 3641 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 5500 NumberOfCodeBlocks, 5446 NumberOfCodeBlocksAsserted, 165 NumberOfCheckSat, 5950 ConstructedInterpolants, 0 QuantifiedInterpolants, 39445 SizeOfPredicates, 38 NumberOfNonLiveVariables, 3398 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 42678/452362 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:58:13,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e720a86a-6cbc-427e-9a29-ff9f8a109908/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE