./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label31.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfc66911488db0449024c8298d45a8f19a48d6acc429700f07d0b84fc6ce385a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:59:10,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:59:10,518 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:59:10,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:59:10,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:59:10,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:59:10,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:59:10,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:59:10,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:59:10,549 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:59:10,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:59:10,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:59:10,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:59:10,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:59:10,553 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:59:10,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:59:10,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:59:10,554 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:59:10,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:59:10,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:59:10,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:59:10,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:59:10,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:59:10,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:59:10,558 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:59:10,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:59:10,559 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:59:10,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:59:10,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:59:10,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:59:10,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:59:10,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:59:10,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:59:10,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:59:10,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:59:10,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:59:10,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:59:10,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:59:10,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:59:10,564 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:59:10,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:59:10,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:59:10,565 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/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_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfc66911488db0449024c8298d45a8f19a48d6acc429700f07d0b84fc6ce385a [2023-11-29 02:59:10,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:59:10,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:59:10,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:59:10,841 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:59:10,841 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:59:10,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/eca-rers2012/Problem11_label31.c [2023-11-29 02:59:13,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:59:14,062 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:59:14,063 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/sv-benchmarks/c/eca-rers2012/Problem11_label31.c [2023-11-29 02:59:14,081 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/data/77519cbfe/bb868c5dd320478a8b6b972c990ee58a/FLAGc0fb0dcf7 [2023-11-29 02:59:14,326 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/data/77519cbfe/bb868c5dd320478a8b6b972c990ee58a [2023-11-29 02:59:14,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:59:14,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:59:14,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:59:14,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:59:14,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:59:14,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:59:14" (1/1) ... [2023-11-29 02:59:14,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68022f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:14, skipping insertion in model container [2023-11-29 02:59:14,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:59:14" (1/1) ... [2023-11-29 02:59:14,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:59:14,554 WARN L240 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_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/sv-benchmarks/c/eca-rers2012/Problem11_label31.c[1180,1193] [2023-11-29 02:59:14,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:59:14,854 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:59:14,867 WARN L240 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_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/sv-benchmarks/c/eca-rers2012/Problem11_label31.c[1180,1193] [2023-11-29 02:59:14,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:59:15,005 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:59:15,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15 WrapperNode [2023-11-29 02:59:15,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:59:15,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:59:15,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:59:15,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:59:15,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,170 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2023-11-29 02:59:15,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:59:15,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:59:15,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:59:15,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:59:15,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,242 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 02:59:15,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:59:15,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:59:15,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:59:15,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:59:15,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (1/1) ... [2023-11-29 02:59:15,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:59:15,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:15,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:59:15,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:59:15,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:59:15,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:59:15,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:59:15,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:59:15,488 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:59:15,490 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:59:17,137 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:59:17,195 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:59:17,195 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:59:17,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:59:17 BoogieIcfgContainer [2023-11-29 02:59:17,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:59:17,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:59:17,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:59:17,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:59:17,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:59:14" (1/3) ... [2023-11-29 02:59:17,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d4976b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:59:17, skipping insertion in model container [2023-11-29 02:59:17,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:59:15" (2/3) ... [2023-11-29 02:59:17,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d4976b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:59:17, skipping insertion in model container [2023-11-29 02:59:17,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:59:17" (3/3) ... [2023-11-29 02:59:17,206 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label31.c [2023-11-29 02:59:17,227 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:59:17,228 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:59:17,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:59:17,301 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@7fa74ecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:59:17,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:59:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:59:17,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:17,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:59:17,315 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:17,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1854374530, now seen corresponding path program 1 times [2023-11-29 02:59:17,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:17,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599049907] [2023-11-29 02:59:17,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:17,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:17,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599049907] [2023-11-29 02:59:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599049907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:17,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:17,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:59:17,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639415426] [2023-11-29 02:59:17,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:17,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:59:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:17,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:59:17,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:59:17,540 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:17,596 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2023-11-29 02:59:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:59:17,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 02:59:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:17,612 INFO L225 Difference]: With dead ends: 441 [2023-11-29 02:59:17,612 INFO L226 Difference]: Without dead ends: 219 [2023-11-29 02:59:17,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:59:17,621 INFO L413 NwaCegarLoop]: 355 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, 355 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 [2023-11-29 02:59:17,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:59:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-29 02:59:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-11-29 02:59:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2023-11-29 02:59:17,681 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 6 [2023-11-29 02:59:17,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:17,681 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2023-11-29 02:59:17,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2023-11-29 02:59:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:59:17,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:17,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:59:17,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:59:17,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:17,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1855588273, now seen corresponding path program 1 times [2023-11-29 02:59:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734345513] [2023-11-29 02:59:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:17,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:17,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734345513] [2023-11-29 02:59:17,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734345513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:17,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:17,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:59:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531742161] [2023-11-29 02:59:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:17,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:17,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:17,760 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:18,881 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2023-11-29 02:59:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:18,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 02:59:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:18,886 INFO L225 Difference]: With dead ends: 630 [2023-11-29 02:59:18,886 INFO L226 Difference]: Without dead ends: 412 [2023-11-29 02:59:18,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:18,889 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 201 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:18,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 144 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:59:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-11-29 02:59:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2023-11-29 02:59:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2023-11-29 02:59:18,917 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 6 [2023-11-29 02:59:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:18,917 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2023-11-29 02:59:18,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2023-11-29 02:59:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 02:59:18,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:18,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:18,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:59:18,921 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:18,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1140471862, now seen corresponding path program 1 times [2023-11-29 02:59:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:18,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463263796] [2023-11-29 02:59:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:19,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463263796] [2023-11-29 02:59:19,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463263796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:19,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:19,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:59:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114437798] [2023-11-29 02:59:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:19,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:19,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:19,142 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:20,120 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2023-11-29 02:59:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-11-29 02:59:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:20,125 INFO L225 Difference]: With dead ends: 1208 [2023-11-29 02:59:20,125 INFO L226 Difference]: Without dead ends: 799 [2023-11-29 02:59:20,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:20,128 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:20,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:59:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2023-11-29 02:59:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2023-11-29 02:59:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3847133757961783) internal successors, (1087), 785 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1087 transitions. [2023-11-29 02:59:20,164 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1087 transitions. Word has length 74 [2023-11-29 02:59:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:20,165 INFO L495 AbstractCegarLoop]: Abstraction has 786 states and 1087 transitions. [2023-11-29 02:59:20,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1087 transitions. [2023-11-29 02:59:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 02:59:20,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:20,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:20,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:59:20,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:20,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1553419013, now seen corresponding path program 1 times [2023-11-29 02:59:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722057141] [2023-11-29 02:59:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:20,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722057141] [2023-11-29 02:59:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722057141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:20,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:20,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:59:20,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390315659] [2023-11-29 02:59:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:20,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:20,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:20,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:20,452 INFO L87 Difference]: Start difference. First operand 786 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:21,350 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2023-11-29 02:59:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:21,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-11-29 02:59:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:21,359 INFO L225 Difference]: With dead ends: 1941 [2023-11-29 02:59:21,359 INFO L226 Difference]: Without dead ends: 1156 [2023-11-29 02:59:21,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:21,361 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:21,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:59:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2023-11-29 02:59:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1155. [2023-11-29 02:59:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2772963604852687) internal successors, (1474), 1154 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1474 transitions. [2023-11-29 02:59:21,395 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1474 transitions. Word has length 76 [2023-11-29 02:59:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:21,396 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1474 transitions. [2023-11-29 02:59:21,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1474 transitions. [2023-11-29 02:59:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 02:59:21,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:21,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:21,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:59:21,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:21,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1224405646, now seen corresponding path program 1 times [2023-11-29 02:59:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082504466] [2023-11-29 02:59:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:21,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:21,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082504466] [2023-11-29 02:59:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082504466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:21,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:21,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:21,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347195359] [2023-11-29 02:59:21,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:21,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:21,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:21,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:21,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:21,616 INFO L87 Difference]: Start difference. First operand 1155 states and 1474 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:22,552 INFO L93 Difference]: Finished difference Result 2690 states and 3512 transitions. [2023-11-29 02:59:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:22,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2023-11-29 02:59:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:22,564 INFO L225 Difference]: With dead ends: 2690 [2023-11-29 02:59:22,564 INFO L226 Difference]: Without dead ends: 1720 [2023-11-29 02:59:22,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:22,567 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 199 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:22,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 333 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:59:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2023-11-29 02:59:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1527. [2023-11-29 02:59:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1526 states have (on average 1.2608125819134994) internal successors, (1924), 1526 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1924 transitions. [2023-11-29 02:59:22,607 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1924 transitions. Word has length 118 [2023-11-29 02:59:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:22,608 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 1924 transitions. [2023-11-29 02:59:22,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1924 transitions. [2023-11-29 02:59:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-11-29 02:59:22,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:22,614 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:22,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:59:22,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:22,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 41257950, now seen corresponding path program 1 times [2023-11-29 02:59:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483591410] [2023-11-29 02:59:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:23,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483591410] [2023-11-29 02:59:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483591410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720494179] [2023-11-29 02:59:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:23,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:23,285 INFO L87 Difference]: Start difference. First operand 1527 states and 1924 transitions. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:24,801 INFO L93 Difference]: Finished difference Result 4164 states and 5467 transitions. [2023-11-29 02:59:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:24,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2023-11-29 02:59:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:24,814 INFO L225 Difference]: With dead ends: 4164 [2023-11-29 02:59:24,814 INFO L226 Difference]: Without dead ends: 2638 [2023-11-29 02:59:24,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:24,818 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 233 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:24,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 176 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 02:59:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2023-11-29 02:59:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638. [2023-11-29 02:59:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2638 states, 2637 states have (on average 1.2131209708001516) internal successors, (3199), 2637 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 3199 transitions. [2023-11-29 02:59:24,868 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 3199 transitions. Word has length 188 [2023-11-29 02:59:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:24,869 INFO L495 AbstractCegarLoop]: Abstraction has 2638 states and 3199 transitions. [2023-11-29 02:59:24,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 3199 transitions. [2023-11-29 02:59:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-11-29 02:59:24,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:24,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:24,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:59:24,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:24,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1143846921, now seen corresponding path program 1 times [2023-11-29 02:59:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536419671] [2023-11-29 02:59:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 02:59:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536419671] [2023-11-29 02:59:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536419671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:25,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:25,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:25,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242276085] [2023-11-29 02:59:25,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:25,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:25,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:25,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:25,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:25,197 INFO L87 Difference]: Start difference. First operand 2638 states and 3199 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:26,106 INFO L93 Difference]: Finished difference Result 6018 states and 7423 transitions. [2023-11-29 02:59:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2023-11-29 02:59:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:26,122 INFO L225 Difference]: With dead ends: 6018 [2023-11-29 02:59:26,122 INFO L226 Difference]: Without dead ends: 3381 [2023-11-29 02:59:26,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:26,126 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 194 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:26,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 374 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:59:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2023-11-29 02:59:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3193. [2023-11-29 02:59:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3192 states have (on average 1.1970551378446115) internal successors, (3821), 3192 states have internal predecessors, (3821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 3821 transitions. [2023-11-29 02:59:26,242 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 3821 transitions. Word has length 198 [2023-11-29 02:59:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:26,243 INFO L495 AbstractCegarLoop]: Abstraction has 3193 states and 3821 transitions. [2023-11-29 02:59:26,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 3821 transitions. [2023-11-29 02:59:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-11-29 02:59:26,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:26,248 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:26,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:59:26,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:26,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1637632777, now seen corresponding path program 1 times [2023-11-29 02:59:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171205286] [2023-11-29 02:59:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:26,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:26,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171205286] [2023-11-29 02:59:26,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171205286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:26,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:26,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560151436] [2023-11-29 02:59:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:26,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:26,843 INFO L87 Difference]: Start difference. First operand 3193 states and 3821 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:27,984 INFO L93 Difference]: Finished difference Result 6937 states and 8295 transitions. [2023-11-29 02:59:27,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:27,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2023-11-29 02:59:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:28,002 INFO L225 Difference]: With dead ends: 6937 [2023-11-29 02:59:28,002 INFO L226 Difference]: Without dead ends: 3745 [2023-11-29 02:59:28,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:28,007 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 312 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:28,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 163 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:59:28,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2023-11-29 02:59:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3561. [2023-11-29 02:59:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3561 states, 3560 states have (on average 1.1918539325842696) internal successors, (4243), 3560 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 4243 transitions. [2023-11-29 02:59:28,090 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 4243 transitions. Word has length 198 [2023-11-29 02:59:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:28,091 INFO L495 AbstractCegarLoop]: Abstraction has 3561 states and 4243 transitions. [2023-11-29 02:59:28,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 4243 transitions. [2023-11-29 02:59:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-11-29 02:59:28,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:28,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:28,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:59:28,096 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:28,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash -818792117, now seen corresponding path program 1 times [2023-11-29 02:59:28,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:28,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763981946] [2023-11-29 02:59:28,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:28,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:28,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763981946] [2023-11-29 02:59:28,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763981946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:28,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:28,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857601844] [2023-11-29 02:59:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:28,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:28,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:28,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:28,787 INFO L87 Difference]: Start difference. First operand 3561 states and 4243 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:30,626 INFO L93 Difference]: Finished difference Result 9898 states and 12005 transitions. [2023-11-29 02:59:30,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:30,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2023-11-29 02:59:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:30,662 INFO L225 Difference]: With dead ends: 9898 [2023-11-29 02:59:30,662 INFO L226 Difference]: Without dead ends: 6338 [2023-11-29 02:59:30,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:30,667 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 249 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:30,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 70 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 02:59:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2023-11-29 02:59:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6147. [2023-11-29 02:59:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6147 states, 6146 states have (on average 1.1874389847054996) internal successors, (7298), 6146 states have internal predecessors, (7298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7298 transitions. [2023-11-29 02:59:30,806 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7298 transitions. Word has length 203 [2023-11-29 02:59:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:30,807 INFO L495 AbstractCegarLoop]: Abstraction has 6147 states and 7298 transitions. [2023-11-29 02:59:30,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7298 transitions. [2023-11-29 02:59:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-29 02:59:30,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:30,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:30,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:59:30,812 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:30,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -293885864, now seen corresponding path program 1 times [2023-11-29 02:59:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:30,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800171490] [2023-11-29 02:59:30,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:30,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 02:59:31,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:31,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800171490] [2023-11-29 02:59:31,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800171490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:31,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:31,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:59:31,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314292021] [2023-11-29 02:59:31,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:31,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:31,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:31,012 INFO L87 Difference]: Start difference. First operand 6147 states and 7298 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:31,997 INFO L93 Difference]: Finished difference Result 13760 states and 16669 transitions. [2023-11-29 02:59:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:31,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2023-11-29 02:59:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:32,034 INFO L225 Difference]: With dead ends: 13760 [2023-11-29 02:59:32,035 INFO L226 Difference]: Without dead ends: 7982 [2023-11-29 02:59:32,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:32,041 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:32,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 152 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:59:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7982 states. [2023-11-29 02:59:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7982 to 7612. [2023-11-29 02:59:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7612 states, 7611 states have (on average 1.1730390224674814) internal successors, (8928), 7611 states have internal predecessors, (8928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7612 states to 7612 states and 8928 transitions. [2023-11-29 02:59:32,167 INFO L78 Accepts]: Start accepts. Automaton has 7612 states and 8928 transitions. Word has length 209 [2023-11-29 02:59:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:32,167 INFO L495 AbstractCegarLoop]: Abstraction has 7612 states and 8928 transitions. [2023-11-29 02:59:32,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7612 states and 8928 transitions. [2023-11-29 02:59:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-29 02:59:32,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:32,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:32,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:59:32,171 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:32,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:32,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1150645033, now seen corresponding path program 1 times [2023-11-29 02:59:32,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84101132] [2023-11-29 02:59:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:32,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:32,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:32,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84101132] [2023-11-29 02:59:32,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84101132] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:32,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627387745] [2023-11-29 02:59:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:32,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:32,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:32,818 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:32,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:59:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:32,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:59:32,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:33,540 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:59:33,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627387745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:33,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:59:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-29 02:59:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996010116] [2023-11-29 02:59:33,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:33,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:33,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:33,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:59:33,543 INFO L87 Difference]: Start difference. First operand 7612 states and 8928 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:34,651 INFO L93 Difference]: Finished difference Result 15595 states and 18276 transitions. [2023-11-29 02:59:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:34,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2023-11-29 02:59:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:34,665 INFO L225 Difference]: With dead ends: 15595 [2023-11-29 02:59:34,665 INFO L226 Difference]: Without dead ends: 8352 [2023-11-29 02:59:34,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:59:34,671 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 192 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:34,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 183 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:59:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8352 states. [2023-11-29 02:59:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8352 to 8164. [2023-11-29 02:59:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8164 states, 8163 states have (on average 1.1657478868063211) internal successors, (9516), 8163 states have internal predecessors, (9516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 9516 transitions. [2023-11-29 02:59:34,801 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 9516 transitions. Word has length 219 [2023-11-29 02:59:34,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:34,802 INFO L495 AbstractCegarLoop]: Abstraction has 8164 states and 9516 transitions. [2023-11-29 02:59:34,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 9516 transitions. [2023-11-29 02:59:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-11-29 02:59:34,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:34,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:34,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:59:35,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 02:59:35,008 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:35,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1785978940, now seen corresponding path program 1 times [2023-11-29 02:59:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:35,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077921421] [2023-11-29 02:59:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-29 02:59:35,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:35,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077921421] [2023-11-29 02:59:35,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077921421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:35,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:35,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:35,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585770327] [2023-11-29 02:59:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:35,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:59:35,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:35,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:59:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:35,254 INFO L87 Difference]: Start difference. First operand 8164 states and 9516 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:36,230 INFO L93 Difference]: Finished difference Result 17436 states and 20570 transitions. [2023-11-29 02:59:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:59:36,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2023-11-29 02:59:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:36,247 INFO L225 Difference]: With dead ends: 17436 [2023-11-29 02:59:36,247 INFO L226 Difference]: Without dead ends: 9457 [2023-11-29 02:59:36,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:59:36,254 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:36,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 375 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:59:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9457 states. [2023-11-29 02:59:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9457 to 9451. [2023-11-29 02:59:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9451 states, 9450 states have (on average 1.1583068783068784) internal successors, (10946), 9450 states have internal predecessors, (10946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9451 states to 9451 states and 10946 transitions. [2023-11-29 02:59:36,359 INFO L78 Accepts]: Start accepts. Automaton has 9451 states and 10946 transitions. Word has length 225 [2023-11-29 02:59:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:36,359 INFO L495 AbstractCegarLoop]: Abstraction has 9451 states and 10946 transitions. [2023-11-29 02:59:36,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9451 states and 10946 transitions. [2023-11-29 02:59:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2023-11-29 02:59:36,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:36,365 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:36,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:59:36,365 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:36,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:36,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2111006371, now seen corresponding path program 1 times [2023-11-29 02:59:36,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:36,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914222075] [2023-11-29 02:59:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 02:59:37,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:37,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914222075] [2023-11-29 02:59:37,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914222075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:59:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507039117] [2023-11-29 02:59:37,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:37,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:59:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:59:37,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:37,042 INFO L87 Difference]: Start difference. First operand 9451 states and 10946 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:38,241 INFO L93 Difference]: Finished difference Result 20412 states and 23614 transitions. [2023-11-29 02:59:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:59:38,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2023-11-29 02:59:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:38,265 INFO L225 Difference]: With dead ends: 20412 [2023-11-29 02:59:38,265 INFO L226 Difference]: Without dead ends: 11289 [2023-11-29 02:59:38,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:59:38,275 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 142 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:38,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 173 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:59:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11289 states. [2023-11-29 02:59:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11289 to 9448. [2023-11-29 02:59:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9448 states, 9447 states have (on average 1.1566634910553615) internal successors, (10927), 9447 states have internal predecessors, (10927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9448 states to 9448 states and 10927 transitions. [2023-11-29 02:59:38,392 INFO L78 Accepts]: Start accepts. Automaton has 9448 states and 10927 transitions. Word has length 268 [2023-11-29 02:59:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:38,392 INFO L495 AbstractCegarLoop]: Abstraction has 9448 states and 10927 transitions. [2023-11-29 02:59:38,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 9448 states and 10927 transitions. [2023-11-29 02:59:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-11-29 02:59:38,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:38,397 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:38,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:59:38,397 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:38,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:38,398 INFO L85 PathProgramCache]: Analyzing trace with hash 354071915, now seen corresponding path program 1 times [2023-11-29 02:59:38,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:38,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664723698] [2023-11-29 02:59:38,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:38,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:59:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664723698] [2023-11-29 02:59:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664723698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:38,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:38,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286227039] [2023-11-29 02:59:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:38,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:38,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:38,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:38,833 INFO L87 Difference]: Start difference. First operand 9448 states and 10927 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:40,095 INFO L93 Difference]: Finished difference Result 18902 states and 21866 transitions. [2023-11-29 02:59:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:40,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2023-11-29 02:59:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:40,108 INFO L225 Difference]: With dead ends: 18902 [2023-11-29 02:59:40,108 INFO L226 Difference]: Without dead ends: 9823 [2023-11-29 02:59:40,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:40,117 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 217 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:40,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 178 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:59:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9823 states. [2023-11-29 02:59:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9823 to 9448. [2023-11-29 02:59:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9448 states, 9447 states have (on average 1.155393246533291) internal successors, (10915), 9447 states have internal predecessors, (10915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9448 states to 9448 states and 10915 transitions. [2023-11-29 02:59:40,268 INFO L78 Accepts]: Start accepts. Automaton has 9448 states and 10915 transitions. Word has length 273 [2023-11-29 02:59:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:40,269 INFO L495 AbstractCegarLoop]: Abstraction has 9448 states and 10915 transitions. [2023-11-29 02:59:40,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9448 states and 10915 transitions. [2023-11-29 02:59:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2023-11-29 02:59:40,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:40,275 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:40,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:59:40,275 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:40,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:40,276 INFO L85 PathProgramCache]: Analyzing trace with hash 23071681, now seen corresponding path program 1 times [2023-11-29 02:59:40,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:40,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069350173] [2023-11-29 02:59:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:40,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:41,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069350173] [2023-11-29 02:59:41,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069350173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:41,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:41,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:59:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482400899] [2023-11-29 02:59:41,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:41,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:41,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:41,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:41,150 INFO L87 Difference]: Start difference. First operand 9448 states and 10915 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:42,561 INFO L93 Difference]: Finished difference Result 21113 states and 24723 transitions. [2023-11-29 02:59:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:42,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2023-11-29 02:59:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:42,579 INFO L225 Difference]: With dead ends: 21113 [2023-11-29 02:59:42,579 INFO L226 Difference]: Without dead ends: 12034 [2023-11-29 02:59:42,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:42,588 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 273 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:42,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 118 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:59:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12034 states. [2023-11-29 02:59:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12034 to 11656. [2023-11-29 02:59:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11656 states, 11655 states have (on average 1.1691119691119691) internal successors, (13626), 11655 states have internal predecessors, (13626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11656 states to 11656 states and 13626 transitions. [2023-11-29 02:59:42,754 INFO L78 Accepts]: Start accepts. Automaton has 11656 states and 13626 transitions. Word has length 280 [2023-11-29 02:59:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:42,755 INFO L495 AbstractCegarLoop]: Abstraction has 11656 states and 13626 transitions. [2023-11-29 02:59:42,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 11656 states and 13626 transitions. [2023-11-29 02:59:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2023-11-29 02:59:42,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:42,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:42,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:59:42,760 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:42,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:42,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1308362519, now seen corresponding path program 1 times [2023-11-29 02:59:42,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:42,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497857446] [2023-11-29 02:59:42,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:43,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497857446] [2023-11-29 02:59:43,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497857446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:43,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:43,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:43,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530336591] [2023-11-29 02:59:43,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:43,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:43,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:43,044 INFO L87 Difference]: Start difference. First operand 11656 states and 13626 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:44,484 INFO L93 Difference]: Finished difference Result 31611 states and 36815 transitions. [2023-11-29 02:59:44,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:44,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280 [2023-11-29 02:59:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:44,502 INFO L225 Difference]: With dead ends: 31611 [2023-11-29 02:59:44,502 INFO L226 Difference]: Without dead ends: 20324 [2023-11-29 02:59:44,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:44,510 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 203 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:44,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 78 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:59:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20324 states. [2023-11-29 02:59:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20324 to 20322. [2023-11-29 02:59:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20322 states, 20321 states have (on average 1.1462034348703312) internal successors, (23292), 20321 states have internal predecessors, (23292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20322 states to 20322 states and 23292 transitions. [2023-11-29 02:59:44,716 INFO L78 Accepts]: Start accepts. Automaton has 20322 states and 23292 transitions. Word has length 280 [2023-11-29 02:59:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:44,717 INFO L495 AbstractCegarLoop]: Abstraction has 20322 states and 23292 transitions. [2023-11-29 02:59:44,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 20322 states and 23292 transitions. [2023-11-29 02:59:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2023-11-29 02:59:44,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:44,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:44,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:59:44,721 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:44,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:44,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1407177634, now seen corresponding path program 1 times [2023-11-29 02:59:44,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:44,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695394788] [2023-11-29 02:59:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:45,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:45,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695394788] [2023-11-29 02:59:45,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695394788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:45,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:45,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428294536] [2023-11-29 02:59:45,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:45,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:45,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:45,271 INFO L87 Difference]: Start difference. First operand 20322 states and 23292 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:46,728 INFO L93 Difference]: Finished difference Result 42117 states and 48191 transitions. [2023-11-29 02:59:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:46,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 288 [2023-11-29 02:59:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:46,749 INFO L225 Difference]: With dead ends: 42117 [2023-11-29 02:59:46,750 INFO L226 Difference]: Without dead ends: 21795 [2023-11-29 02:59:46,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:46,760 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 149 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:46,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 108 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:59:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21795 states. [2023-11-29 02:59:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21795 to 21793. [2023-11-29 02:59:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21793 states, 21792 states have (on average 1.1383076358296622) internal successors, (24806), 21792 states have internal predecessors, (24806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21793 states to 21793 states and 24806 transitions. [2023-11-29 02:59:47,029 INFO L78 Accepts]: Start accepts. Automaton has 21793 states and 24806 transitions. Word has length 288 [2023-11-29 02:59:47,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:47,030 INFO L495 AbstractCegarLoop]: Abstraction has 21793 states and 24806 transitions. [2023-11-29 02:59:47,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 21793 states and 24806 transitions. [2023-11-29 02:59:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-11-29 02:59:47,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:47,034 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:47,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:59:47,034 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:47,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:47,035 INFO L85 PathProgramCache]: Analyzing trace with hash -621453629, now seen corresponding path program 1 times [2023-11-29 02:59:47,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:47,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989944913] [2023-11-29 02:59:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:47,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-29 02:59:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989944913] [2023-11-29 02:59:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989944913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:47,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:47,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:59:47,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453820516] [2023-11-29 02:59:47,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:47,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:59:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:47,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:59:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:59:47,590 INFO L87 Difference]: Start difference. First operand 21793 states and 24806 transitions. Second operand has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:48,563 INFO L93 Difference]: Finished difference Result 40205 states and 45902 transitions. [2023-11-29 02:59:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:59:48,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2023-11-29 02:59:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:48,580 INFO L225 Difference]: With dead ends: 40205 [2023-11-29 02:59:48,580 INFO L226 Difference]: Without dead ends: 21417 [2023-11-29 02:59:48,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:59:48,590 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 219 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:48,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 85 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:59:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21417 states. [2023-11-29 02:59:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21417 to 21414. [2023-11-29 02:59:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21414 states, 21413 states have (on average 1.1346845374305328) internal successors, (24297), 21413 states have internal predecessors, (24297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21414 states to 21414 states and 24297 transitions. [2023-11-29 02:59:48,807 INFO L78 Accepts]: Start accepts. Automaton has 21414 states and 24297 transitions. Word has length 290 [2023-11-29 02:59:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:48,807 INFO L495 AbstractCegarLoop]: Abstraction has 21414 states and 24297 transitions. [2023-11-29 02:59:48,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 21414 states and 24297 transitions. [2023-11-29 02:59:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2023-11-29 02:59:48,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:48,811 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:48,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:59:48,811 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:48,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1101625168, now seen corresponding path program 1 times [2023-11-29 02:59:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:48,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053241897] [2023-11-29 02:59:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053241897] [2023-11-29 02:59:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053241897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:59:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166017385] [2023-11-29 02:59:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:49,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:59:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:49,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:59:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:59:49,761 INFO L87 Difference]: Start difference. First operand 21414 states and 24297 transitions. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:51,569 INFO L93 Difference]: Finished difference Result 50065 states and 56801 transitions. [2023-11-29 02:59:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:59:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2023-11-29 02:59:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:51,594 INFO L225 Difference]: With dead ends: 50065 [2023-11-29 02:59:51,594 INFO L226 Difference]: Without dead ends: 28962 [2023-11-29 02:59:51,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:59:51,606 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 226 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:51,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 176 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 02:59:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28962 states. [2023-11-29 02:59:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28962 to 27118. [2023-11-29 02:59:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27118 states, 27117 states have (on average 1.1250138289633809) internal successors, (30507), 27117 states have internal predecessors, (30507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27118 states to 27118 states and 30507 transitions. [2023-11-29 02:59:52,001 INFO L78 Accepts]: Start accepts. Automaton has 27118 states and 30507 transitions. Word has length 295 [2023-11-29 02:59:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:52,001 INFO L495 AbstractCegarLoop]: Abstraction has 27118 states and 30507 transitions. [2023-11-29 02:59:52,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 27118 states and 30507 transitions. [2023-11-29 02:59:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-11-29 02:59:52,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:52,007 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:52,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:59:52,008 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:52,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:52,008 INFO L85 PathProgramCache]: Analyzing trace with hash 238941914, now seen corresponding path program 1 times [2023-11-29 02:59:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:52,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557161313] [2023-11-29 02:59:52,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:52,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-11-29 02:59:52,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:52,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557161313] [2023-11-29 02:59:52,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557161313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:52,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:52,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:52,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555276635] [2023-11-29 02:59:52,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:52,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:52,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:52,351 INFO L87 Difference]: Start difference. First operand 27118 states and 30507 transitions. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:53,484 INFO L93 Difference]: Finished difference Result 54606 states and 61492 transitions. [2023-11-29 02:59:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 311 [2023-11-29 02:59:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:53,508 INFO L225 Difference]: With dead ends: 54606 [2023-11-29 02:59:53,508 INFO L226 Difference]: Without dead ends: 30067 [2023-11-29 02:59:53,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:53,518 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 192 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:53,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 149 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:59:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30067 states. [2023-11-29 02:59:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30067 to 26750. [2023-11-29 02:59:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26750 states, 26749 states have (on average 1.1247897117649257) internal successors, (30087), 26749 states have internal predecessors, (30087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26750 states to 26750 states and 30087 transitions. [2023-11-29 02:59:53,802 INFO L78 Accepts]: Start accepts. Automaton has 26750 states and 30087 transitions. Word has length 311 [2023-11-29 02:59:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:53,803 INFO L495 AbstractCegarLoop]: Abstraction has 26750 states and 30087 transitions. [2023-11-29 02:59:53,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 26750 states and 30087 transitions. [2023-11-29 02:59:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-11-29 02:59:53,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:53,807 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:53,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:59:53,807 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:53,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1024825020, now seen corresponding path program 1 times [2023-11-29 02:59:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:53,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055818278] [2023-11-29 02:59:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:59:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:54,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055818278] [2023-11-29 02:59:54,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055818278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:54,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:54,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:59:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290366189] [2023-11-29 02:59:54,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:54,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:59:54,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:54,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:59:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:54,444 INFO L87 Difference]: Start difference. First operand 26750 states and 30087 transitions. Second operand has 5 states, 5 states have (on average 62.8) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:55,827 INFO L93 Difference]: Finished difference Result 53136 states and 59907 transitions. [2023-11-29 02:59:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:59:55,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 62.8) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 314 [2023-11-29 02:59:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:55,852 INFO L225 Difference]: With dead ends: 53136 [2023-11-29 02:59:55,852 INFO L226 Difference]: Without dead ends: 29149 [2023-11-29 02:59:55,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:59:55,864 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 371 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:55,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 181 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:59:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29149 states. [2023-11-29 02:59:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29149 to 28410. [2023-11-29 02:59:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28410 states, 28409 states have (on average 1.120313985004752) internal successors, (31827), 28409 states have internal predecessors, (31827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28410 states to 28410 states and 31827 transitions. [2023-11-29 02:59:56,213 INFO L78 Accepts]: Start accepts. Automaton has 28410 states and 31827 transitions. Word has length 314 [2023-11-29 02:59:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:56,214 INFO L495 AbstractCegarLoop]: Abstraction has 28410 states and 31827 transitions. [2023-11-29 02:59:56,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.8) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 28410 states and 31827 transitions. [2023-11-29 02:59:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-29 02:59:56,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:56,218 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:56,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:59:56,218 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:56,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2028728016, now seen corresponding path program 1 times [2023-11-29 02:59:56,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:56,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309516917] [2023-11-29 02:59:56,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:56,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-29 02:59:56,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:56,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309516917] [2023-11-29 02:59:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309516917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:59:56,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:59:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:59:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067832179] [2023-11-29 02:59:56,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:59:56,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:59:56,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:59:56,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:59:56,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:56,698 INFO L87 Difference]: Start difference. First operand 28410 states and 31827 transitions. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:58,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:58,046 INFO L93 Difference]: Finished difference Result 54242 states and 60949 transitions. [2023-11-29 02:59:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:59:58,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2023-11-29 02:59:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:58,074 INFO L225 Difference]: With dead ends: 54242 [2023-11-29 02:59:58,075 INFO L226 Difference]: Without dead ends: 28227 [2023-11-29 02:59:58,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:59:58,090 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 247 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:58,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 59 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:59:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2023-11-29 02:59:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 28226. [2023-11-29 02:59:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28226 states, 28225 states have (on average 1.1184056687333923) internal successors, (31567), 28225 states have internal predecessors, (31567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28226 states to 28226 states and 31567 transitions. [2023-11-29 02:59:58,419 INFO L78 Accepts]: Start accepts. Automaton has 28226 states and 31567 transitions. Word has length 315 [2023-11-29 02:59:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:58,419 INFO L495 AbstractCegarLoop]: Abstraction has 28226 states and 31567 transitions. [2023-11-29 02:59:58,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:59:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 28226 states and 31567 transitions. [2023-11-29 02:59:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2023-11-29 02:59:58,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:58,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:59:58,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:59:58,423 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:59:58,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash 265909564, now seen corresponding path program 1 times [2023-11-29 02:59:58,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:59:58,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144289524] [2023-11-29 02:59:58,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:58,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:59:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2023-11-29 02:59:58,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:59:58,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144289524] [2023-11-29 02:59:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144289524] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:58,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992968796] [2023-11-29 02:59:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:58,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:59:58,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:59:58,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:59:58,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:59:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:59,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:59:59,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2023-11-29 02:59:59,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2023-11-29 03:00:01,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992968796] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:01,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:00:01,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2023-11-29 03:00:01,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561953722] [2023-11-29 03:00:01,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:00:01,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:00:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:00:01,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:00:01,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:00:01,878 INFO L87 Difference]: Start difference. First operand 28226 states and 31567 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:03,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:00:03,351 INFO L93 Difference]: Finished difference Result 33944 states and 38312 transitions. [2023-11-29 03:00:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:00:03,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 326 [2023-11-29 03:00:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:00:03,378 INFO L225 Difference]: With dead ends: 33944 [2023-11-29 03:00:03,378 INFO L226 Difference]: Without dead ends: 33942 [2023-11-29 03:00:03,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:00:03,384 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 300 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:00:03,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 117 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 03:00:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33942 states. [2023-11-29 03:00:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33942 to 28962. [2023-11-29 03:00:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28962 states, 28961 states have (on average 1.1188149580470288) internal successors, (32402), 28961 states have internal predecessors, (32402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28962 states to 28962 states and 32402 transitions. [2023-11-29 03:00:03,710 INFO L78 Accepts]: Start accepts. Automaton has 28962 states and 32402 transitions. Word has length 326 [2023-11-29 03:00:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:00:03,711 INFO L495 AbstractCegarLoop]: Abstraction has 28962 states and 32402 transitions. [2023-11-29 03:00:03,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 28962 states and 32402 transitions. [2023-11-29 03:00:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2023-11-29 03:00:03,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:00:03,716 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:00:03,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:00:03,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 03:00:03,917 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:00:03,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:00:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1744875877, now seen corresponding path program 1 times [2023-11-29 03:00:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:00:03,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008721725] [2023-11-29 03:00:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:00:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 83 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:00:04,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:00:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008721725] [2023-11-29 03:00:04,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008721725] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:04,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062012973] [2023-11-29 03:00:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:04,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:00:04,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:00:04,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:00:04,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:00:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:04,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:00:04,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2023-11-29 03:00:05,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:00:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062012973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:00:05,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:00:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2023-11-29 03:00:05,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677548825] [2023-11-29 03:00:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:00:05,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:00:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:00:05,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:00:05,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:00:05,117 INFO L87 Difference]: Start difference. First operand 28962 states and 32402 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:00:06,194 INFO L93 Difference]: Finished difference Result 54984 states and 61701 transitions. [2023-11-29 03:00:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:00:06,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2023-11-29 03:00:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:00:06,219 INFO L225 Difference]: With dead ends: 54984 [2023-11-29 03:00:06,219 INFO L226 Difference]: Without dead ends: 28969 [2023-11-29 03:00:06,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:00:06,231 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 177 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:00:06,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 161 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:00:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28969 states. [2023-11-29 03:00:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28969 to 28410. [2023-11-29 03:00:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28410 states, 28409 states have (on average 1.1186947798232953) internal successors, (31781), 28409 states have internal predecessors, (31781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28410 states to 28410 states and 31781 transitions. [2023-11-29 03:00:06,535 INFO L78 Accepts]: Start accepts. Automaton has 28410 states and 31781 transitions. Word has length 337 [2023-11-29 03:00:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:00:06,535 INFO L495 AbstractCegarLoop]: Abstraction has 28410 states and 31781 transitions. [2023-11-29 03:00:06,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 28410 states and 31781 transitions. [2023-11-29 03:00:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2023-11-29 03:00:06,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:00:06,540 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:00:06,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:00:06,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 03:00:06,741 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:00:06,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:00:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1273267515, now seen corresponding path program 1 times [2023-11-29 03:00:06,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:00:06,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308969435] [2023-11-29 03:00:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:06,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:00:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 112 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:00:07,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:00:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308969435] [2023-11-29 03:00:07,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308969435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827949467] [2023-11-29 03:00:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:07,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:00:07,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:00:07,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:00:07,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:00:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:07,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 03:00:07,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 112 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:00:09,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 112 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:00:11,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827949467] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:00:11,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:00:11,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 03:00:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792661954] [2023-11-29 03:00:11,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:00:11,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:00:11,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:00:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:00:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:00:11,528 INFO L87 Difference]: Start difference. First operand 28410 states and 31781 transitions. Second operand has 10 states, 10 states have (on average 61.6) internal successors, (616), 9 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:00:15,075 INFO L93 Difference]: Finished difference Result 58721 states and 65770 transitions. [2023-11-29 03:00:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:00:15,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 61.6) internal successors, (616), 9 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2023-11-29 03:00:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:00:15,102 INFO L225 Difference]: With dead ends: 58721 [2023-11-29 03:00:15,102 INFO L226 Difference]: Without dead ends: 30496 [2023-11-29 03:00:15,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:00:15,116 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1471 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 3182 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 3182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:00:15,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 101 Invalid, 3826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 3182 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 03:00:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30496 states. [2023-11-29 03:00:15,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30496 to 26385. [2023-11-29 03:00:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26385 states, 26384 states have (on average 1.1102562158884173) internal successors, (29293), 26384 states have internal predecessors, (29293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26385 states to 26385 states and 29293 transitions. [2023-11-29 03:00:15,442 INFO L78 Accepts]: Start accepts. Automaton has 26385 states and 29293 transitions. Word has length 337 [2023-11-29 03:00:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:00:15,443 INFO L495 AbstractCegarLoop]: Abstraction has 26385 states and 29293 transitions. [2023-11-29 03:00:15,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.6) internal successors, (616), 9 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand 26385 states and 29293 transitions. [2023-11-29 03:00:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2023-11-29 03:00:15,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:00:15,448 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:00:15,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:00:15,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 03:00:15,648 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:00:15,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:00:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash -349578067, now seen corresponding path program 1 times [2023-11-29 03:00:15,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:00:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249380341] [2023-11-29 03:00:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:00:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2023-11-29 03:00:15,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:00:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249380341] [2023-11-29 03:00:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249380341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:00:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:00:15,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:00:15,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184890326] [2023-11-29 03:00:15,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:00:15,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:00:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:00:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:00:15,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:00:15,853 INFO L87 Difference]: Start difference. First operand 26385 states and 29293 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:00:16,904 INFO L93 Difference]: Finished difference Result 50558 states and 56182 transitions. [2023-11-29 03:00:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:00:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2023-11-29 03:00:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:00:16,926 INFO L225 Difference]: With dead ends: 50558 [2023-11-29 03:00:16,926 INFO L226 Difference]: Without dead ends: 25830 [2023-11-29 03:00:16,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:00:16,936 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:00:16,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 343 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:00:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25830 states. [2023-11-29 03:00:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25830 to 25462. [2023-11-29 03:00:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25462 states, 25461 states have (on average 1.097246769569145) internal successors, (27937), 25461 states have internal predecessors, (27937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25462 states to 25462 states and 27937 transitions. [2023-11-29 03:00:17,212 INFO L78 Accepts]: Start accepts. Automaton has 25462 states and 27937 transitions. Word has length 343 [2023-11-29 03:00:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:00:17,212 INFO L495 AbstractCegarLoop]: Abstraction has 25462 states and 27937 transitions. [2023-11-29 03:00:17,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 25462 states and 27937 transitions. [2023-11-29 03:00:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2023-11-29 03:00:17,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:00:17,220 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:00:17,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 03:00:17,220 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:00:17,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:00:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash -369332337, now seen corresponding path program 1 times [2023-11-29 03:00:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:00:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035909862] [2023-11-29 03:00:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:00:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2023-11-29 03:00:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:00:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035909862] [2023-11-29 03:00:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035909862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:00:17,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:00:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:00:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879606708] [2023-11-29 03:00:17,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:00:17,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:00:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:00:17,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:00:17,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:00:17,674 INFO L87 Difference]: Start difference. First operand 25462 states and 27937 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:00:18,631 INFO L93 Difference]: Finished difference Result 49093 states and 54134 transitions. [2023-11-29 03:00:18,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:00:18,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 396 [2023-11-29 03:00:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:00:18,652 INFO L225 Difference]: With dead ends: 49093 [2023-11-29 03:00:18,652 INFO L226 Difference]: Without dead ends: 26210 [2023-11-29 03:00:18,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:00:18,661 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 120 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:00:18,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 355 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:00:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26210 states. [2023-11-29 03:00:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26210 to 25836. [2023-11-29 03:00:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25836 states, 25835 states have (on average 1.0972711437971743) internal successors, (28348), 25835 states have internal predecessors, (28348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25836 states to 25836 states and 28348 transitions. [2023-11-29 03:00:19,114 INFO L78 Accepts]: Start accepts. Automaton has 25836 states and 28348 transitions. Word has length 396 [2023-11-29 03:00:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:00:19,114 INFO L495 AbstractCegarLoop]: Abstraction has 25836 states and 28348 transitions. [2023-11-29 03:00:19,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:00:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 25836 states and 28348 transitions. [2023-11-29 03:00:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2023-11-29 03:00:19,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:00:19,125 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:00:19,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 03:00:19,126 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:00:19,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:00:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1764079126, now seen corresponding path program 1 times [2023-11-29 03:00:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:00:19,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113006281] [2023-11-29 03:00:19,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:19,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:00:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:00:19,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:00:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:00:19,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:00:19,368 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:00:19,369 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:00:19,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 03:00:19,373 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:00:19,377 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:00:19,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:00:19 BoogieIcfgContainer [2023-11-29 03:00:19,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:00:19,541 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:00:19,541 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:00:19,541 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:00:19,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:59:17" (3/4) ... [2023-11-29 03:00:19,543 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 03:00:19,781 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:00:19,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:00:19,781 INFO L158 Benchmark]: Toolchain (without parser) took 65451.04ms. Allocated memory was 159.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 118.4MB in the beginning and 906.1MB in the end (delta: -787.7MB). Peak memory consumption was 522.0MB. Max. memory is 16.1GB. [2023-11-29 03:00:19,781 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:00:19,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 674.02ms. Allocated memory is still 159.4MB. Free memory was 118.4MB in the beginning and 72.5MB in the end (delta: 45.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2023-11-29 03:00:19,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 164.06ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 72.5MB in the beginning and 164.4MB in the end (delta: -91.8MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2023-11-29 03:00:19,782 INFO L158 Benchmark]: Boogie Preprocessor took 167.90ms. Allocated memory is still 209.7MB. Free memory was 164.4MB in the beginning and 139.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 03:00:19,783 INFO L158 Benchmark]: RCFGBuilder took 1854.51ms. Allocated memory is still 209.7MB. Free memory was 139.2MB in the beginning and 133.3MB in the end (delta: 5.9MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2023-11-29 03:00:19,783 INFO L158 Benchmark]: TraceAbstraction took 62341.40ms. Allocated memory was 209.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 133.3MB in the beginning and 936.5MB in the end (delta: -803.2MB). Peak memory consumption was 452.0MB. Max. memory is 16.1GB. [2023-11-29 03:00:19,784 INFO L158 Benchmark]: Witness Printer took 239.91ms. Allocated memory is still 1.5GB. Free memory was 936.5MB in the beginning and 906.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-29 03:00:19,785 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.19ms. Allocated memory is still 159.4MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 674.02ms. Allocated memory is still 159.4MB. Free memory was 118.4MB in the beginning and 72.5MB in the end (delta: 45.9MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 164.06ms. Allocated memory was 159.4MB in the beginning and 209.7MB in the end (delta: 50.3MB). Free memory was 72.5MB in the beginning and 164.4MB in the end (delta: -91.8MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 167.90ms. Allocated memory is still 209.7MB. Free memory was 164.4MB in the beginning and 139.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1854.51ms. Allocated memory is still 209.7MB. Free memory was 139.2MB in the beginning and 133.3MB in the end (delta: 5.9MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * TraceAbstraction took 62341.40ms. Allocated memory was 209.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 133.3MB in the beginning and 936.5MB in the end (delta: -803.2MB). Peak memory consumption was 452.0MB. Max. memory is 16.1GB. * Witness Printer took 239.91ms. Allocated memory is still 1.5GB. Free memory was 936.5MB in the beginning and 906.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 37]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputA = 1; [L18] int inputD = 4; [L19] int inputB = 2; [L20] int inputE = 5; [L21] int inputF = 6; [L22] int inputC = 3; [L25] int a29 = 130; [L26] int a4 = 1; [L27] int a23 = 312; [L28] int a8 = 15; [L29] int a25 = 10; [L30] int a3 = 1; [L1041] int output = -1; VAL [a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1044] COND TRUE 1 [L1047] int input; [L1048] EXPR input = __VERIFIER_nondet_int() [L1049] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L790] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L802] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L809] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L826] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L832] COND FALSE !(( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a8==15) && ((((a3==1) && ((((a25==10) || (a25==11)) && (input == 6)) && a29 <= 140 )) && a23 <= -43 ) && !(a4==1)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((a8==15) && (((a25==13) || ((a25==11) || (a25==12))) && (input == 4))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L846] COND FALSE !((((a3==1) && ((a8==15) && ((((a25==13) && (input == 4)) && (a4==1)) && a29 <= 140 ))) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L851] COND FALSE !((( 306 < a23 && ((a25==13) && ((((input == 3) && a29 <= 140 ) && (a3==1)) && (a4==1)))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L856] COND FALSE !((!(a4==1) && (( 277 < a29 && ((((input == 4) && a23 <= -43 ) && (a8==15)) && (a3==1))) && (a25==13)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L862] COND FALSE !(((a3==1) && (((((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ) || (( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==12))) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13))))) && (input == 1)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !(( 277 < a29 && ((a3==1) && ((a8==15) && ((a4==1) && ( 306 < a23 && ((input == 6) && (((a25==9) || (a25==10)) || (a25==11))))))))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 4) && ((a25==12) || ((a25==10) || (a25==11))))) && (a8==15)) && !(a4==1)) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L886] COND FALSE !(((((( a23 <= -43 && ((input == 5) && ((a25==12) || ((a25==10) || (a25==11))))) && (a3==1)) && !(a4==1)) && 277 < a29 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L891] COND FALSE !(((((a8==15) && ((a4==1) && (((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 2)))) && (a3==1)) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L896] COND FALSE !((( a23 <= -43 && ((( ((140 < a29) && (245 >= a29)) && ((input == 1) && (((a25==9) || (a25==10)) || (a25==11)))) && !(a4==1)) && (a8==15))) && (a3==1))) VAL [\old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L903] COND TRUE ((((a3==1) && ((((input == 2) && ((a25==12) || ((a25==10) || (a25==11)))) && (a4==1)) && (a8==15))) && a29 <= 140 ) && 306 < a23 ) [L905] a25 = 13 [L907] return 23; VAL [\old(input)=2, \result=23, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] EXPR output = calculate_output(input) [L1045-L1053] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1044] COND TRUE 1 [L1047] int input; [L1048] EXPR input = __VERIFIER_nondet_int() [L1049] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L278] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L297] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L304] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L332] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L344] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L356] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L368] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L387] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L401] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L421] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L427] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L432] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L439] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L453] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L466] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L473] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L480] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L541] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L547] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L552] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L559] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L576] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L582] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L585] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L591] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L596] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L608] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L638] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L645] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L652] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L657] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L668] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L673] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L680] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L685] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L691] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L727] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L741] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L748] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L753] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L760] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L767] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L779] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L784] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L790] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L797] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L802] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L809] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L814] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L826] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L832] COND TRUE ( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15))) [L833] a29 = (((a29 / 5) + 165004) + 41645) [L834] return 23; VAL [\old(input)=2, \result=23, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] EXPR output = calculate_output(input) [L1045-L1053] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1044] COND TRUE 1 [L1047] int input; [L1048] EXPR input = __VERIFIER_nondet_int() [L1049] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL, EXPR calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L204] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L213] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L224] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L237] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L243] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(input)=4, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L250] COND TRUE ((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1)) [L251] a29 = ((((a29 / 5) % 15)+ 260) + 1) [L252] a23 = (((((a23 / 5) % 90)- -47) - -159208) - 159206) [L253] a4 = 1 [L254] a25 = 11 [L256] return -1; VAL [\old(input)=4, \result=-1, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1052] RET, EXPR calculate_output(input) [L1052] EXPR output = calculate_output(input) [L1045-L1053] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1044] COND TRUE 1 [L1047] int input; [L1048] input = __VERIFIER_nondet_int() [L1049] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L1052] CALL calculate_output(input) [L33] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(input)=5, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND TRUE ((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) VAL [\old(input)=5, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] reach_error() VAL [\old(input)=5, a23=111, a25=11, a29=271, a3=1, a4=1, a8=15, input=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.1s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 34.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6651 SdHoareTripleChecker+Valid, 30.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6651 mSDsluCounter, 5015 SdHoareTripleChecker+Invalid, 26.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 955 mSDsCounter, 3617 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24761 IncrementalHoareTripleChecker+Invalid, 28378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3617 mSolverCounterUnsat, 4060 mSDtfsCounter, 24761 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1975 GetRequests, 1901 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28962occurred in iteration=23, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 20230 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 7990 NumberOfCodeBlocks, 7990 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8222 ConstructedInterpolants, 0 QuantifiedInterpolants, 51343 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1708 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 26 PerfectInterpolantSequences, 4793/5506 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! [2023-11-29 03:00:19,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cffa25b-7646-4a05-b57f-1a7f0c706d9d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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