./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb55eb0e5d7c4df3b95a55b83f19894edf68e79ccb0eab5e69a8aa23c994caed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:30:28,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:30:28,544 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:30:28,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:30:28,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:30:28,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:30:28,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:30:28,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:30:28,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:30:28,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:30:28,629 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:30:28,630 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:30:28,630 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:30:28,631 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:30:28,631 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:30:28,631 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:30:28,632 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:30:28,632 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:30:28,636 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:30:28,636 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:30:28,636 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:30:28,637 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:30:28,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:30:28,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:30:28,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:30:28,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:30:28,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:30:28,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:30:28,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:30:28,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:30:28,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:30:28,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:30:28,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:30:28,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:30:28,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:30:28,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:30:28,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:30:28,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:30:28,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:30:28,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:30:28,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:30:28,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:30:28,647 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:30:28,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:30:28,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:30:28,648 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:30:28,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:30:28,649 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/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_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> cb55eb0e5d7c4df3b95a55b83f19894edf68e79ccb0eab5e69a8aa23c994caed [2024-11-09 04:30:29,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:30:29,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:30:29,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:30:29,080 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:30:29,081 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:30:29,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c Unable to find full path for "g++" [2024-11-09 04:30:31,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:30:31,551 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:30:31,552 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2024-11-09 04:30:31,561 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/data/06e3f500b/ffd0715f1785413089e3d8648786a985/FLAG50a30679f [2024-11-09 04:30:31,608 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/data/06e3f500b/ffd0715f1785413089e3d8648786a985 [2024-11-09 04:30:31,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:30:31,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:30:31,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:30:31,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:30:31,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:30:31,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:31,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fa1476a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31, skipping insertion in model container [2024-11-09 04:30:31,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:31,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:30:31,902 WARN L250 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_25ee0344-8d23-4832-bac4-d2bc3b75952b/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2024-11-09 04:30:31,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:30:31,942 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:30:31,956 WARN L250 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_25ee0344-8d23-4832-bac4-d2bc3b75952b/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound50.c[588,601] [2024-11-09 04:30:31,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:30:31,990 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:30:31,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31 WrapperNode [2024-11-09 04:30:31,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:30:31,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:30:31,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:30:31,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:30:32,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,024 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-11-09 04:30:32,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:30:32,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:30:32,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:30:32,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:30:32,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:30:32,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:30:32,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:30:32,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:30:32,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (1/1) ... [2024-11-09 04:30:32,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:30:32,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:32,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:30:32,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:30:32,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:30:32,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:30:32,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:30:32,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:30:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 04:30:32,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 04:30:32,229 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:30:32,232 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:30:32,462 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-09 04:30:32,462 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:30:32,508 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:30:32,508 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 04:30:32,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:32 BoogieIcfgContainer [2024-11-09 04:30:32,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:30:32,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:30:32,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:30:32,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:30:32,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:30:31" (1/3) ... [2024-11-09 04:30:32,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ebb04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:30:32, skipping insertion in model container [2024-11-09 04:30:32,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:30:31" (2/3) ... [2024-11-09 04:30:32,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ebb04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:30:32, skipping insertion in model container [2024-11-09 04:30:32,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:32" (3/3) ... [2024-11-09 04:30:32,527 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2024-11-09 04:30:32,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:30:32,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:30:32,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:30:32,703 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@40f6e7bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:30:32,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:30:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 04:30:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 04:30:32,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:32,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 04:30:32,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:32,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1409108064, now seen corresponding path program 1 times [2024-11-09 04:30:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563801742] [2024-11-09 04:30:32,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:32,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:30:32,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563801742] [2024-11-09 04:30:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563801742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:32,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:30:32,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953779906] [2024-11-09 04:30:32,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:32,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 04:30:32,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:33,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 04:30:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:30:33,026 INFO L87 Difference]: Start difference. First operand has 23 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:33,066 INFO L93 Difference]: Finished difference Result 45 states and 82 transitions. [2024-11-09 04:30:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 04:30:33,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 04:30:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:33,078 INFO L225 Difference]: With dead ends: 45 [2024-11-09 04:30:33,078 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 04:30:33,083 INFO L431 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 [2024-11-09 04:30:33,088 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:33,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:30:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 04:30:33,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 04:30:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 04:30:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2024-11-09 04:30:33,139 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 6 [2024-11-09 04:30:33,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:33,139 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2024-11-09 04:30:33,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2024-11-09 04:30:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 04:30:33,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:33,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:33,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:30:33,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:33,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1262155372, now seen corresponding path program 1 times [2024-11-09 04:30:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049303169] [2024-11-09 04:30:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:30:33,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049303169] [2024-11-09 04:30:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049303169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:33,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:33,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:30:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181609943] [2024-11-09 04:30:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:33,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:30:33,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:33,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:30:33,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:30:33,369 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:33,407 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2024-11-09 04:30:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:30:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 04:30:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:33,409 INFO L225 Difference]: With dead ends: 35 [2024-11-09 04:30:33,409 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 04:30:33,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:30:33,412 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:33,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:30:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 04:30:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 04:30:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 04:30:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2024-11-09 04:30:33,447 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 7 [2024-11-09 04:30:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:33,448 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2024-11-09 04:30:33,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2024-11-09 04:30:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 04:30:33,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:33,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:33,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:30:33,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:33,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1260606240, now seen corresponding path program 1 times [2024-11-09 04:30:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:33,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920264951] [2024-11-09 04:30:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:30:33,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:33,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920264951] [2024-11-09 04:30:33,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920264951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:33,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:33,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:30:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912335139] [2024-11-09 04:30:33,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:33,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:30:33,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:33,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:30:33,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:30:33,767 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:34,004 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2024-11-09 04:30:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:30:34,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 04:30:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:34,008 INFO L225 Difference]: With dead ends: 29 [2024-11-09 04:30:34,008 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 04:30:34,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:30:34,011 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:34,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 78 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:30:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 04:30:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 04:30:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 04:30:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2024-11-09 04:30:34,031 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 7 [2024-11-09 04:30:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:34,032 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2024-11-09 04:30:34,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:30:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-09 04:30:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:30:34,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:34,034 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:34,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:30:34,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:34,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 136342820, now seen corresponding path program 1 times [2024-11-09 04:30:34,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:34,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685339392] [2024-11-09 04:30:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:34,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732731066] [2024-11-09 04:30:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:34,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:34,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:34,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:34,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:30:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:34,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 04:30:34,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:30:34,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:34,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:34,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685339392] [2024-11-09 04:30:34,333 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:30:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732731066] [2024-11-09 04:30:34,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732731066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:34,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:34,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:30:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641821072] [2024-11-09 04:30:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:34,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:30:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:34,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:30:34,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:30:34,341 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:30:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:34,537 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2024-11-09 04:30:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:30:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 04:30:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:34,540 INFO L225 Difference]: With dead ends: 45 [2024-11-09 04:30:34,541 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 04:30:34,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:30:34,543 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:34,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 125 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:30:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 04:30:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2024-11-09 04:30:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 04:30:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-09 04:30:34,572 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 12 [2024-11-09 04:30:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:34,575 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-09 04:30:34,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 04:30:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-11-09 04:30:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 04:30:34,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:34,576 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:34,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 04:30:34,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:34,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:34,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1566265120, now seen corresponding path program 1 times [2024-11-09 04:30:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442613077] [2024-11-09 04:30:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:34,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723140838] [2024-11-09 04:30:34,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:34,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:34,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:34,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:34,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:30:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:34,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 04:30:34,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 04:30:34,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:34,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:34,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442613077] [2024-11-09 04:30:34,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:30:34,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723140838] [2024-11-09 04:30:34,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723140838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:34,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:30:34,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532037752] [2024-11-09 04:30:34,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:34,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:30:34,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:35,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:30:35,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:30:35,000 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:30:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:35,198 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2024-11-09 04:30:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:30:35,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-09 04:30:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:35,201 INFO L225 Difference]: With dead ends: 49 [2024-11-09 04:30:35,201 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 04:30:35,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:30:35,202 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:35,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:30:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 04:30:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-11-09 04:30:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 04:30:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-11-09 04:30:35,240 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 17 [2024-11-09 04:30:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:35,241 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-11-09 04:30:35,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 04:30:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-11-09 04:30:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 04:30:35,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:35,242 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:35,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 04:30:35,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:35,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:35,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash -588815772, now seen corresponding path program 1 times [2024-11-09 04:30:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709981044] [2024-11-09 04:30:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189855749] [2024-11-09 04:30:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:35,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:35,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:35,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:35,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:30:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:35,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 04:30:35,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 04:30:35,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:30:35,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709981044] [2024-11-09 04:30:35,748 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:30:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189855749] [2024-11-09 04:30:35,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189855749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:30:35,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:30:35,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:30:35,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256390336] [2024-11-09 04:30:35,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:30:35,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:30:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:35,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:30:35,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:30:35,756 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 04:30:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:35,929 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2024-11-09 04:30:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:30:35,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-11-09 04:30:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:35,932 INFO L225 Difference]: With dead ends: 57 [2024-11-09 04:30:35,932 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 04:30:35,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:30:35,937 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:35,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 114 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:30:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 04:30:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 04:30:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 04:30:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-11-09 04:30:35,966 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 22 [2024-11-09 04:30:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:35,967 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-11-09 04:30:35,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 04:30:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2024-11-09 04:30:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 04:30:35,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:35,971 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:35,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 04:30:36,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:36,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:36,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1301226262, now seen corresponding path program 1 times [2024-11-09 04:30:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:36,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251296282] [2024-11-09 04:30:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 04:30:36,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:36,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251296282] [2024-11-09 04:30:36,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251296282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:30:36,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845751102] [2024-11-09 04:30:36,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:36,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:36,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:36,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:36,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:30:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:36,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 04:30:36,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-09 04:30:36,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 04:30:36,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845751102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1425790440] [2024-11-09 04:30:36,737 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:30:36,737 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:36,742 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:36,749 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:36,750 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:38,983 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:30:38,991 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:30:39,518 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1191#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:30:39,518 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:30:39,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:30:39,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-11-09 04:30:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617920117] [2024-11-09 04:30:39,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:30:39,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 04:30:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:39,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 04:30:39,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-09 04:30:39,521 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 04:30:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:39,807 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2024-11-09 04:30:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:30:39,810 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 40 [2024-11-09 04:30:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:39,812 INFO L225 Difference]: With dead ends: 115 [2024-11-09 04:30:39,812 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 04:30:39,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-11-09 04:30:39,813 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 57 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:39,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 113 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:30:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 04:30:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-09 04:30:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 04:30:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2024-11-09 04:30:39,835 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 40 [2024-11-09 04:30:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:39,836 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2024-11-09 04:30:39,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-09 04:30:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2024-11-09 04:30:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 04:30:39,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:39,837 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:39,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 04:30:40,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:40,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1793341578, now seen corresponding path program 1 times [2024-11-09 04:30:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293588271] [2024-11-09 04:30:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1107187285] [2024-11-09 04:30:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:40,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:40,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:40,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:40,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:30:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:40,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 04:30:40,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 04:30:40,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 04:30:40,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293588271] [2024-11-09 04:30:40,599 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:30:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107187285] [2024-11-09 04:30:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107187285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [836179967] [2024-11-09 04:30:40,604 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 04:30:40,604 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:40,604 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:40,605 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:40,605 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:42,329 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:30:42,336 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:30:42,994 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1796#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:30:42,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:30:42,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:30:42,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 04:30:42,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527154932] [2024-11-09 04:30:42,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:30:42,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:30:42,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:42,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:30:42,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-09 04:30:42,997 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 04:30:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:43,473 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2024-11-09 04:30:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:30:43,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 40 [2024-11-09 04:30:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:43,476 INFO L225 Difference]: With dead ends: 113 [2024-11-09 04:30:43,477 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 04:30:43,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2024-11-09 04:30:43,479 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:43,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 90 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:30:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 04:30:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 04:30:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 61 states have internal predecessors, (65), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 04:30:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2024-11-09 04:30:43,524 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 40 [2024-11-09 04:30:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2024-11-09 04:30:43,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-09 04:30:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2024-11-09 04:30:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 04:30:43,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:43,529 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:43,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 04:30:43,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:43,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:43,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:43,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1380758394, now seen corresponding path program 2 times [2024-11-09 04:30:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488226512] [2024-11-09 04:30:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:43,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931097191] [2024-11-09 04:30:43,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:30:43,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:43,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:43,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:43,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:30:43,822 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 04:30:43,823 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:30:43,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 04:30:43,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 04:30:43,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 04:30:44,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:44,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488226512] [2024-11-09 04:30:44,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:30:44,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931097191] [2024-11-09 04:30:44,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931097191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:44,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [737622977] [2024-11-09 04:30:44,053 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 04:30:44,053 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:44,053 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:44,053 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:44,053 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:45,548 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:30:45,555 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:30:46,169 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2450#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:30:46,170 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:30:46,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:30:46,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-09 04:30:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789512369] [2024-11-09 04:30:46,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:30:46,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 04:30:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 04:30:46,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-09 04:30:46,172 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 04:30:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:46,394 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2024-11-09 04:30:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:30:46,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2024-11-09 04:30:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:46,397 INFO L225 Difference]: With dead ends: 117 [2024-11-09 04:30:46,397 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 04:30:46,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-09 04:30:46,399 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:46,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 245 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:30:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 04:30:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 04:30:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 64 states have internal predecessors, (68), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-09 04:30:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2024-11-09 04:30:46,435 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 45 [2024-11-09 04:30:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:46,435 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-11-09 04:30:46,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 04:30:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2024-11-09 04:30:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 04:30:46,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:46,437 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:46,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 04:30:46,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:46,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:46,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1798789558, now seen corresponding path program 3 times [2024-11-09 04:30:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188393802] [2024-11-09 04:30:46,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:46,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540207598] [2024-11-09 04:30:46,685 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:30:46,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:46,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:46,687 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:46,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 04:30:46,771 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:30:46,771 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:30:46,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 04:30:46,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 04:30:46,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 04:30:47,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188393802] [2024-11-09 04:30:47,213 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:30:47,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540207598] [2024-11-09 04:30:47,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540207598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:47,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [454853674] [2024-11-09 04:30:47,215 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 04:30:47,216 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:47,216 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:47,216 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:47,216 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:48,252 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:30:48,260 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:30:48,874 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3140#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:30:48,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:30:48,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:30:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-09 04:30:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32830919] [2024-11-09 04:30:48,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:30:48,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:30:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:48,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:30:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-09 04:30:48,877 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 04:30:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:49,259 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2024-11-09 04:30:49,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:30:49,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 50 [2024-11-09 04:30:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:49,263 INFO L225 Difference]: With dead ends: 141 [2024-11-09 04:30:49,263 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 04:30:49,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 130 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-09 04:30:49,269 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:49,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 122 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:30:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 04:30:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-09 04:30:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 82 states have internal predecessors, (86), 29 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 04:30:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2024-11-09 04:30:49,309 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 50 [2024-11-09 04:30:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:49,309 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2024-11-09 04:30:49,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 04:30:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2024-11-09 04:30:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 04:30:49,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:49,310 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:49,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 04:30:49,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 04:30:49,516 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:49,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash -854128991, now seen corresponding path program 1 times [2024-11-09 04:30:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:49,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549394840] [2024-11-09 04:30:49,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:49,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071538668] [2024-11-09 04:30:49,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:49,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:49,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:49,550 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:49,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 04:30:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:49,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 04:30:49,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 04:30:50,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 04:30:50,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549394840] [2024-11-09 04:30:50,974 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:30:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071538668] [2024-11-09 04:30:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071538668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1789669896] [2024-11-09 04:30:50,975 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:30:50,975 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:50,978 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:50,978 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:50,978 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:52,024 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:30:52,030 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:30:52,698 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3988#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:30:52,698 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:30:52,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:30:52,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-11-09 04:30:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047066473] [2024-11-09 04:30:52,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:30:52,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:30:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:52,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:30:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2024-11-09 04:30:52,701 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-09 04:30:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:53,303 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2024-11-09 04:30:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:30:53,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 66 [2024-11-09 04:30:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:53,307 INFO L225 Difference]: With dead ends: 146 [2024-11-09 04:30:53,307 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 04:30:53,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2024-11-09 04:30:53,309 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:53,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 155 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:30:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 04:30:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-09 04:30:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 90 states have internal predecessors, (93), 31 states have call successors, (31), 24 states have call predecessors, (31), 23 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 04:30:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2024-11-09 04:30:53,343 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 66 [2024-11-09 04:30:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:53,344 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2024-11-09 04:30:53,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-09 04:30:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2024-11-09 04:30:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 04:30:53,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:53,346 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:53,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 04:30:53,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 04:30:53,547 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:53,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash 763073155, now seen corresponding path program 1 times [2024-11-09 04:30:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394143373] [2024-11-09 04:30:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:53,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739784323] [2024-11-09 04:30:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:53,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:53,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:53,577 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:53,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 04:30:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:53,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 04:30:53,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 04:30:54,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 04:30:54,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394143373] [2024-11-09 04:30:54,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:30:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739784323] [2024-11-09 04:30:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739784323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1984024379] [2024-11-09 04:30:54,501 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 04:30:54,501 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:54,502 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:54,502 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:54,502 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:55,579 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:30:55,585 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:30:56,283 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4895#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:30:56,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:30:56,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:30:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-09 04:30:56,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917657884] [2024-11-09 04:30:56,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:30:56,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 04:30:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 04:30:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:30:56,285 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-09 04:30:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:57,273 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2024-11-09 04:30:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 04:30:57,274 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 71 [2024-11-09 04:30:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:57,275 INFO L225 Difference]: With dead ends: 162 [2024-11-09 04:30:57,276 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 04:30:57,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2024-11-09 04:30:57,278 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:57,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 120 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:30:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 04:30:57,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-09 04:30:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 80 states have (on average 1.05) internal successors, (84), 82 states have internal predecessors, (84), 30 states have call successors, (30), 21 states have call predecessors, (30), 21 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-09 04:30:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-11-09 04:30:57,324 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 71 [2024-11-09 04:30:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:57,324 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-11-09 04:30:57,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-09 04:30:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-11-09 04:30:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 04:30:57,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:57,326 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-11-09 04:30:57,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 04:30:57,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 04:30:57,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:30:57,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:30:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash 521563348, now seen corresponding path program 4 times [2024-11-09 04:30:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:30:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939800918] [2024-11-09 04:30:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:30:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:30:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:30:57,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257736456] [2024-11-09 04:30:57,559 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 04:30:57,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:30:57,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:30:57,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:30:57,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 04:30:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:30:57,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 04:30:57,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:30:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 23 proven. 52 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 04:30:57,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:30:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 23 proven. 52 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 04:30:58,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:30:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939800918] [2024-11-09 04:30:58,014 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:30:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257736456] [2024-11-09 04:30:58,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257736456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:30:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [9630270] [2024-11-09 04:30:58,016 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 04:30:58,017 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:30:58,017 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:30:58,017 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:30:58,018 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:30:58,887 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:30:58,890 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:30:59,367 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5827#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:30:59,367 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:30:59,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:30:59,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-09 04:30:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065232279] [2024-11-09 04:30:59,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:30:59,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 04:30:59,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:30:59,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 04:30:59,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:30:59,369 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-09 04:30:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:30:59,753 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2024-11-09 04:30:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:30:59,754 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 73 [2024-11-09 04:30:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:30:59,755 INFO L225 Difference]: With dead ends: 138 [2024-11-09 04:30:59,755 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 04:30:59,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2024-11-09 04:30:59,756 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:30:59,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:30:59,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 04:30:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-09 04:30:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.036144578313253) internal successors, (86), 85 states have internal predecessors, (86), 30 states have call successors, (30), 22 states have call predecessors, (30), 22 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-09 04:30:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2024-11-09 04:30:59,798 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 73 [2024-11-09 04:30:59,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:30:59,799 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2024-11-09 04:30:59,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-09 04:30:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2024-11-09 04:30:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 04:30:59,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:30:59,801 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:30:59,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 04:31:00,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 04:31:00,002 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:00,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1241004216, now seen corresponding path program 2 times [2024-11-09 04:31:00,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:00,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114673482] [2024-11-09 04:31:00,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:00,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 04:31:00,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:00,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114673482] [2024-11-09 04:31:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114673482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:31:00,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755633239] [2024-11-09 04:31:00,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:31:00,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:00,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:00,323 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:00,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 04:31:00,556 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-09 04:31:00,556 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:31:00,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 04:31:00,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:31:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-09 04:31:00,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:31:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 04:31:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755633239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:31:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1196136400] [2024-11-09 04:31:00,925 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:31:00,925 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:31:00,925 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:31:00,925 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:31:00,926 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:31:01,710 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:31:01,715 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:31:02,111 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7029#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:31:02,111 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:31:02,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:31:02,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-11-09 04:31:02,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733288365] [2024-11-09 04:31:02,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:31:02,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 04:31:02,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:02,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 04:31:02,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-11-09 04:31:02,114 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) [2024-11-09 04:31:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:02,702 INFO L93 Difference]: Finished difference Result 376 states and 391 transitions. [2024-11-09 04:31:02,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 04:31:02,703 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) Word has length 124 [2024-11-09 04:31:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:02,706 INFO L225 Difference]: With dead ends: 376 [2024-11-09 04:31:02,706 INFO L226 Difference]: Without dead ends: 353 [2024-11-09 04:31:02,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 353 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2024-11-09 04:31:02,709 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 105 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:31:02,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 129 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:31:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-09 04:31:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2024-11-09 04:31:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 195 states have (on average 1.041025641025641) internal successors, (203), 201 states have internal predecessors, (203), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 04:31:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 325 transitions. [2024-11-09 04:31:02,800 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 325 transitions. Word has length 124 [2024-11-09 04:31:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:02,800 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 325 transitions. [2024-11-09 04:31:02,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) [2024-11-09 04:31:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 325 transitions. [2024-11-09 04:31:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 04:31:02,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:02,803 INFO L215 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:02,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 04:31:03,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:03,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:03,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash 945481745, now seen corresponding path program 2 times [2024-11-09 04:31:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283055386] [2024-11-09 04:31:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:31:03,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936249726] [2024-11-09 04:31:03,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:31:03,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:03,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:03,049 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:03,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 04:31:03,271 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 04:31:03,271 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:31:03,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 04:31:03,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:31:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 326 proven. 61 refuted. 0 times theorem prover too weak. 1151 trivial. 0 not checked. [2024-11-09 04:31:04,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:31:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 200 proven. 39 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2024-11-09 04:31:07,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:07,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283055386] [2024-11-09 04:31:07,440 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 04:31:07,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936249726] [2024-11-09 04:31:07,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936249726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:31:07,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [262501697] [2024-11-09 04:31:07,442 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 04:31:07,443 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:31:07,443 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:31:07,443 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:31:07,443 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:31:08,374 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:31:08,379 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:31:09,188 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9074#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:31:09,188 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:31:09,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:31:09,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-09 04:31:09,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699164040] [2024-11-09 04:31:09,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 04:31:09,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 04:31:09,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:09,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 04:31:09,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2024-11-09 04:31:09,190 INFO L87 Difference]: Start difference. First operand 311 states and 325 transitions. Second operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 9 states have call predecessors, (31), 9 states have call successors, (31) [2024-11-09 04:31:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:10,302 INFO L93 Difference]: Finished difference Result 318 states and 331 transitions. [2024-11-09 04:31:10,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:31:10,302 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 9 states have call predecessors, (31), 9 states have call successors, (31) Word has length 155 [2024-11-09 04:31:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:10,304 INFO L225 Difference]: With dead ends: 318 [2024-11-09 04:31:10,305 INFO L226 Difference]: Without dead ends: 292 [2024-11-09 04:31:10,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 433 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-11-09 04:31:10,306 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:31:10,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 176 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 04:31:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-09 04:31:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-09 04:31:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 187 states have (on average 1.0106951871657754) internal successors, (189), 188 states have internal predecessors, (189), 53 states have call successors, (53), 51 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 04:31:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 294 transitions. [2024-11-09 04:31:10,391 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 294 transitions. Word has length 155 [2024-11-09 04:31:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:10,391 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 294 transitions. [2024-11-09 04:31:10,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 9 states have call predecessors, (31), 9 states have call successors, (31) [2024-11-09 04:31:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 294 transitions. [2024-11-09 04:31:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-09 04:31:10,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:10,395 INFO L215 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:10,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 04:31:10,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 04:31:10,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:10,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1731479380, now seen corresponding path program 3 times [2024-11-09 04:31:10,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:10,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960787489] [2024-11-09 04:31:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:10,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-09 04:31:11,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:11,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960787489] [2024-11-09 04:31:11,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960787489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:31:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623554023] [2024-11-09 04:31:11,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:31:11,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:11,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:11,570 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:11,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 04:31:11,750 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:31:11,750 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:31:11,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 04:31:11,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:31:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-09 04:31:12,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:31:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2024-11-09 04:31:12,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623554023] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:31:12,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446254751] [2024-11-09 04:31:12,720 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:31:12,720 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:31:12,721 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:31:12,723 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:31:12,724 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:31:13,629 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:31:13,634 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:31:14,235 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11821#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:31:14,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:31:14,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:31:14,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 28 [2024-11-09 04:31:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579333311] [2024-11-09 04:31:14,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:31:14,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 04:31:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:14,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 04:31:14,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=837, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 04:31:14,239 INFO L87 Difference]: Start difference. First operand 292 states and 294 transitions. Second operand has 28 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 28 states have internal predecessors, (107), 21 states have call successors, (153), 12 states have call predecessors, (153), 12 states have return successors, (152), 21 states have call predecessors, (152), 21 states have call successors, (152) [2024-11-09 04:31:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:15,390 INFO L93 Difference]: Finished difference Result 641 states and 655 transitions. [2024-11-09 04:31:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-09 04:31:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 28 states have internal predecessors, (107), 21 states have call successors, (153), 12 states have call predecessors, (153), 12 states have return successors, (152), 21 states have call predecessors, (152), 21 states have call successors, (152) Word has length 292 [2024-11-09 04:31:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:15,395 INFO L225 Difference]: With dead ends: 641 [2024-11-09 04:31:15,395 INFO L226 Difference]: Without dead ends: 628 [2024-11-09 04:31:15,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 845 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=933, Invalid=2147, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 04:31:15,397 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 134 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:31:15,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 189 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:31:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-09 04:31:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2024-11-09 04:31:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 403 states have (on average 1.0049627791563276) internal successors, (405), 404 states have internal predecessors, (405), 113 states have call successors, (113), 111 states have call predecessors, (113), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-09 04:31:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 630 transitions. [2024-11-09 04:31:15,578 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 630 transitions. Word has length 292 [2024-11-09 04:31:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:15,579 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 630 transitions. [2024-11-09 04:31:15,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 28 states have internal predecessors, (107), 21 states have call successors, (153), 12 states have call predecessors, (153), 12 states have return successors, (152), 21 states have call predecessors, (152), 21 states have call successors, (152) [2024-11-09 04:31:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 630 transitions. [2024-11-09 04:31:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2024-11-09 04:31:15,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:15,596 INFO L215 NwaCegarLoop]: trace histogram [112, 111, 111, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:15,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 04:31:15,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 04:31:15,797 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:15,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:15,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1920188556, now seen corresponding path program 4 times [2024-11-09 04:31:15,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:15,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046579505] [2024-11-09 04:31:15,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:15,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 222 proven. 1892 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2024-11-09 04:31:19,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:19,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046579505] [2024-11-09 04:31:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046579505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:31:19,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529703221] [2024-11-09 04:31:19,424 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 04:31:19,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:19,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:19,427 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:19,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 04:31:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:19,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 04:31:19,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:31:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 660 proven. 24992 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-09 04:31:20,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:31:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 222 proven. 1892 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2024-11-09 04:31:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529703221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:31:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1377840448] [2024-11-09 04:31:22,189 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:31:22,189 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:31:22,189 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:31:22,190 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:31:22,190 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:31:23,285 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:31:23,289 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:31:24,232 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17675#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:31:24,233 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:31:24,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:31:24,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 52 [2024-11-09 04:31:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581856710] [2024-11-09 04:31:24,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:31:24,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 04:31:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:24,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 04:31:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2145, Unknown=0, NotChecked=0, Total=3540 [2024-11-09 04:31:24,239 INFO L87 Difference]: Start difference. First operand 628 states and 630 transitions. Second operand has 52 states, 52 states have (on average 4.134615384615385) internal successors, (215), 52 states have internal predecessors, (215), 45 states have call successors, (333), 24 states have call predecessors, (333), 24 states have return successors, (332), 45 states have call predecessors, (332), 45 states have call successors, (332) [2024-11-09 04:31:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:27,408 INFO L93 Difference]: Finished difference Result 1313 states and 1339 transitions. [2024-11-09 04:31:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-09 04:31:27,409 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.134615384615385) internal successors, (215), 52 states have internal predecessors, (215), 45 states have call successors, (333), 24 states have call predecessors, (333), 24 states have return successors, (332), 45 states have call predecessors, (332), 45 states have call successors, (332) Word has length 628 [2024-11-09 04:31:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:27,417 INFO L225 Difference]: With dead ends: 1313 [2024-11-09 04:31:27,418 INFO L226 Difference]: Without dead ends: 1300 [2024-11-09 04:31:27,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1953 GetRequests, 1829 SyntacticMatches, 22 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4477 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3573, Invalid=7139, Unknown=0, NotChecked=0, Total=10712 [2024-11-09 04:31:27,422 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 323 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:31:27,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 277 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 04:31:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-11-09 04:31:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2024-11-09 04:31:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 835 states have (on average 1.0023952095808384) internal successors, (837), 836 states have internal predecessors, (837), 233 states have call successors, (233), 231 states have call predecessors, (233), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2024-11-09 04:31:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1302 transitions. [2024-11-09 04:31:28,082 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1302 transitions. Word has length 628 [2024-11-09 04:31:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:28,083 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1302 transitions. [2024-11-09 04:31:28,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.134615384615385) internal successors, (215), 52 states have internal predecessors, (215), 45 states have call successors, (333), 24 states have call predecessors, (333), 24 states have return successors, (332), 45 states have call predecessors, (332), 45 states have call successors, (332) [2024-11-09 04:31:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1302 transitions. [2024-11-09 04:31:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2024-11-09 04:31:28,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:28,155 INFO L215 NwaCegarLoop]: trace histogram [232, 231, 231, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:28,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 04:31:28,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 04:31:28,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:28,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash 962583812, now seen corresponding path program 5 times [2024-11-09 04:31:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:28,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862776430] [2024-11-09 04:31:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:28,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:31:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 462 proven. 8372 refuted. 0 times theorem prover too weak. 106260 trivial. 0 not checked. [2024-11-09 04:31:42,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:31:42,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862776430] [2024-11-09 04:31:42,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862776430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:31:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025074981] [2024-11-09 04:31:42,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:31:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:42,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:42,821 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:42,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 04:31:46,936 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 162 check-sat command(s) [2024-11-09 04:31:46,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:31:46,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-09 04:31:46,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:31:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 1380 proven. 111872 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2024-11-09 04:31:48,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:31:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 462 proven. 8372 refuted. 0 times theorem prover too weak. 106260 trivial. 0 not checked. [2024-11-09 04:31:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025074981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:31:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293043467] [2024-11-09 04:31:51,137 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 04:31:51,137 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:31:51,137 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:31:51,138 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:31:51,138 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:31:51,890 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2024-11-09 04:31:51,894 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:31:53,474 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '29725#(and (<= 1 |#StackHeapBarrier|) (<= 1 ~counter~0) (= |__VERIFIER_assert_#in~cond| 0))' at error location [2024-11-09 04:31:53,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:31:53,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:31:53,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 50] total 56 [2024-11-09 04:31:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950999145] [2024-11-09 04:31:53,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:31:53,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-09 04:31:53,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:31:53,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-09 04:31:53,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1613, Invalid=2419, Unknown=0, NotChecked=0, Total=4032 [2024-11-09 04:31:53,483 INFO L87 Difference]: Start difference. First operand 1300 states and 1302 transitions. Second operand has 56 states, 56 states have (on average 5.392857142857143) internal successors, (302), 56 states have internal predecessors, (302), 50 states have call successors, (478), 48 states have call predecessors, (478), 48 states have return successors, (477), 50 states have call predecessors, (477), 50 states have call successors, (477) [2024-11-09 04:31:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:31:56,625 INFO L93 Difference]: Finished difference Result 1425 states and 1431 transitions. [2024-11-09 04:31:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-09 04:31:56,626 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 5.392857142857143) internal successors, (302), 56 states have internal predecessors, (302), 50 states have call successors, (478), 48 states have call predecessors, (478), 48 states have return successors, (477), 50 states have call predecessors, (477), 50 states have call successors, (477) Word has length 1300 [2024-11-09 04:31:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:31:56,636 INFO L225 Difference]: With dead ends: 1425 [2024-11-09 04:31:56,637 INFO L226 Difference]: Without dead ends: 1412 [2024-11-09 04:31:56,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3997 GetRequests, 3797 SyntacticMatches, 90 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8303 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4203, Invalid=8229, Unknown=0, NotChecked=0, Total=12432 [2024-11-09 04:31:56,642 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:31:56,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 306 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 04:31:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-11-09 04:31:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2024-11-09 04:31:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 907 states have (on average 1.0022050716648292) internal successors, (909), 908 states have internal predecessors, (909), 253 states have call successors, (253), 251 states have call predecessors, (253), 251 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-09 04:31:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1414 transitions. [2024-11-09 04:31:57,210 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1414 transitions. Word has length 1300 [2024-11-09 04:31:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:31:57,213 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 1414 transitions. [2024-11-09 04:31:57,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 5.392857142857143) internal successors, (302), 56 states have internal predecessors, (302), 50 states have call successors, (478), 48 states have call predecessors, (478), 48 states have return successors, (477), 50 states have call predecessors, (477), 50 states have call successors, (477) [2024-11-09 04:31:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1414 transitions. [2024-11-09 04:31:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1413 [2024-11-09 04:31:57,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:31:57,249 INFO L215 NwaCegarLoop]: trace histogram [252, 251, 251, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:31:57,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 04:31:57,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 04:31:57,450 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:31:57,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:31:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash 917517468, now seen corresponding path program 6 times [2024-11-09 04:31:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:31:57,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389898763] [2024-11-09 04:31:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:31:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:31:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 04:31:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22286303] [2024-11-09 04:31:59,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 04:31:59,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:31:59,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:31:59,136 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:31:59,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 04:32:00,036 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 04:32:00,037 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 04:32:00,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:32:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:32:00,811 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 04:32:00,812 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:32:00,813 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 04:32:00,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 04:32:01,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:32:01,019 INFO L407 BasicCegarLoop]: Path program histogram: [6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:32:01,306 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:32:01,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:32:01 BoogieIcfgContainer [2024-11-09 04:32:01,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:32:01,316 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:32:01,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:32:01,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:32:01,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:30:32" (3/4) ... [2024-11-09 04:32:01,319 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 04:32:01,657 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 04:32:01,657 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:32:01,657 INFO L158 Benchmark]: Toolchain (without parser) took 90041.22ms. Allocated memory was 148.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 121.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 833.4MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,658 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 121.6MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:32:01,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.37ms. Allocated memory is still 148.9MB. Free memory was 120.8MB in the beginning and 108.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.67ms. Allocated memory is still 148.9MB. Free memory was 108.0MB in the beginning and 106.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,659 INFO L158 Benchmark]: Boogie Preprocessor took 23.35ms. Allocated memory is still 148.9MB. Free memory was 106.5MB in the beginning and 105.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:32:01,659 INFO L158 Benchmark]: RCFGBuilder took 459.27ms. Allocated memory is still 148.9MB. Free memory was 105.4MB in the beginning and 92.3MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,659 INFO L158 Benchmark]: TraceAbstraction took 88803.22ms. Allocated memory was 148.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 91.8MB in the beginning and 509.3MB in the end (delta: -417.5MB). Peak memory consumption was 793.5MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,660 INFO L158 Benchmark]: Witness Printer took 340.63ms. Allocated memory is still 1.4GB. Free memory was 509.3MB in the beginning and 1.3GB in the end (delta: -756.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 04:32:01,661 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 121.6MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.37ms. Allocated memory is still 148.9MB. Free memory was 120.8MB in the beginning and 108.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.67ms. Allocated memory is still 148.9MB. Free memory was 108.0MB in the beginning and 106.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.35ms. Allocated memory is still 148.9MB. Free memory was 106.5MB in the beginning and 105.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 459.27ms. Allocated memory is still 148.9MB. Free memory was 105.4MB in the beginning and 92.3MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 88803.22ms. Allocated memory was 148.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 91.8MB in the beginning and 509.3MB in the end (delta: -417.5MB). Peak memory consumption was 793.5MB. Max. memory is 16.1GB. * Witness Printer took 340.63ms. Allocated memory is still 1.4GB. Free memory was 509.3MB in the beginning and 1.3GB in the end (delta: -756.7MB). Peak memory consumption was 12.6MB. 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=50, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=21, n=20, x=8000, y=1261, z=126] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=21, n=21, x=9261, y=1387, z=132] [L33] EXPR counter++ VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=22] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=22, n=21, x=9261, y=1387, z=132] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=22, n=22, x=10648, y=1519, z=138] [L33] EXPR counter++ VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=23] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=23, n=22, x=10648, y=1519, z=138] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=23, n=23, x=12167, y=1657, z=144] [L33] EXPR counter++ VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=24] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=24, n=23, x=12167, y=1657, z=144] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=24, n=24, x=13824, y=1801, z=150] [L33] EXPR counter++ VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=25] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=25, n=24, x=13824, y=1801, z=150] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=25, n=25, x=15625, y=1951, z=156] [L33] EXPR counter++ VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=26] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=26, n=25, x=15625, y=1951, z=156] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=26, n=26, x=17576, y=2107, z=162] [L33] EXPR counter++ VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=27] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=27, n=26, x=17576, y=2107, z=162] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=27, n=27, x=19683, y=2269, z=168] [L33] EXPR counter++ VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=28] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=28, n=27, x=19683, y=2269, z=168] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=28, n=28, x=21952, y=2437, z=174] [L33] EXPR counter++ VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=29] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=29, n=28, x=21952, y=2437, z=174] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=29, n=29, x=24389, y=2611, z=180] [L33] EXPR counter++ VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=30] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=30, n=29, x=24389, y=2611, z=180] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=30, n=30, x=27000, y=2791, z=186] [L33] EXPR counter++ VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=31] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=31, n=30, x=27000, y=2791, z=186] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=31, n=31, x=29791, y=2977, z=192] [L33] EXPR counter++ VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=32] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=32, n=31, x=29791, y=2977, z=192] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=32, n=32, x=32768, y=3169, z=198] [L33] EXPR counter++ VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=33] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=33, n=32, x=32768, y=3169, z=198] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=33, n=33, x=35937, y=3367, z=204] [L33] EXPR counter++ VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=34] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=34, n=33, x=35937, y=3367, z=204] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=34, n=34, x=39304, y=3571, z=210] [L33] EXPR counter++ VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=35] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=35, n=34, x=39304, y=3571, z=210] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=35, n=35, x=42875, y=3781, z=216] [L33] EXPR counter++ VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=36] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=36, n=35, x=42875, y=3781, z=216] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=36, n=36, x=46656, y=3997, z=222] [L33] EXPR counter++ VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=37] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=37, n=36, x=46656, y=3997, z=222] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=37, n=37, x=50653, y=4219, z=228] [L33] EXPR counter++ VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=38] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=38, n=37, x=50653, y=4219, z=228] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=38, n=38, x=54872, y=4447, z=234] [L33] EXPR counter++ VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=39] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=39, n=38, x=54872, y=4447, z=234] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=39, n=39, x=59319, y=4681, z=240] [L33] EXPR counter++ VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=40] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=40, n=39, x=59319, y=4681, z=240] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=40, n=40, x=64000, y=4921, z=246] [L33] EXPR counter++ VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=41] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=41, n=40, x=64000, y=4921, z=246] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=41, n=41, x=68921, y=5167, z=252] [L33] EXPR counter++ VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=42] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=42, n=41, x=68921, y=5167, z=252] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=42, n=42, x=74088, y=5419, z=258] [L33] EXPR counter++ VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=43] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=43, n=42, x=74088, y=5419, z=258] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=43, n=43, x=79507, y=5677, z=264] [L33] EXPR counter++ VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=44] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=44, n=43, x=79507, y=5677, z=264] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=44, n=44, x=85184, y=5941, z=270] [L33] EXPR counter++ VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=45] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=45, n=44, x=85184, y=5941, z=270] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=45, n=45, x=91125, y=6211, z=276] [L33] EXPR counter++ VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=46] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=46, n=45, x=91125, y=6211, z=276] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=46, n=46, x=97336, y=6487, z=282] [L33] EXPR counter++ VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=47] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=47, n=46, x=97336, y=6487, z=282] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=47, n=47, x=103823, y=6769, z=288] [L33] EXPR counter++ VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=48] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=48, n=47, x=103823, y=6769, z=288] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=48, n=48, x=110592, y=7057, z=294] [L33] EXPR counter++ VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=49] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=49, n=48, x=110592, y=7057, z=294] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=49, n=49, x=117649, y=7351, z=300] [L33] EXPR counter++ VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L33] COND TRUE counter++<50 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=50] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=50, counter=50, n=49, x=117649, y=7351, z=300] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=50, counter=50, n=50, x=125000, y=7651, z=306] [L33] EXPR counter++ VAL [a=50, counter=51, n=50, x=125000, y=7651, z=306] [L33] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=51] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=51] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=50, counter=51, n=50, x=125000, y=7651, z=306] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=51] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L17] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 88.4s, OverallIterations: 19, TraceHistogramMax: 252, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.2s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 798 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 741 mSDsluCounter, 2640 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2147 mSDsCounter, 587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2950 IncrementalHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 587 mSolverCounterUnsat, 493 mSDtfsCounter, 2950 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8942 GetRequests, 8305 SyntacticMatches, 148 SemanticMatches, 489 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15772 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1412occurred in iteration=18, InterpolantAutomatonStates: 369, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 61 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.8s SatisfiabilityAnalysisTime, 36.2s InterpolantComputationTime, 8714 NumberOfCodeBlocks, 8576 NumberOfCodeBlocksAsserted, 212 NumberOfCheckSat, 8188 ConstructedInterpolants, 0 QuantifiedInterpolants, 20301 SizeOfPredicates, 102 NumberOfNonLiveVariables, 6348 ConjunctsInSsa, 387 ConjunctsInUnsatCore, 35 InterpolantComputations, 6 PerfectInterpolantSequences, 285872/450100 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! [2024-11-09 04:32:01,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ee0344-8d23-4832-bac4-d2bc3b75952b/bin/utaipan-verify-YMUCfTKeje/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